Artificial and Mathematical Theory of Computation :Papers in Honor of John McCarthy

Publication subTitle :Papers in Honor of John McCarthy

Author: Lifschitz   Vladimir  

Publisher: Elsevier Science‎

Publication year: 2012

E-ISBN: 9780323148313

P-ISBN(Paperback): 9780124500105

P-ISBN(Hardback):  9780124500105

Subject: TP18 artificial intelligence theory

Language: ENG

Access to resources Favorite

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Description

Artificial and Mathematical Theory of Computation is a collection of papers that discusses the technical, historical, and philosophical problems related to artificial intelligence and the mathematical theory of computation. Papers cover the logical approach to artificial intelligence; knowledge representation and common sense reasoning; automated deduction; logic programming; nonmonotonic reasoning and circumscription. One paper suggests that the design of parallel programming languages will invariably become more sophisticated as human skill in programming and software developments improves to attain faster running programs. An example of metaprogramming to systems concerns the design and control of operations of factory devices, such as robots and numerically controlled machine tools. Metaprogramming involves two design aspects: that of the activity of a single device and that of the interaction with other devices. One paper cites the application of artificial intelligence pertaining to the project "proof checker for first-order logic" at the Stanford Artificial Intelligence Laboratory. Another paper explains why the bisection algorithm widely used in computer science does not work. This book can prove valuable to engineers and researchers of electrical, computer, and mechanical engineering, as well as, for computer programmers and designers of industrial processes.

Chapter

Front Cover

pp.:  1 – 4

Copyright Page

pp.:  5 – 6

Tablr of Contents

pp.:  6 – 10

Preface

pp.:  10 – 12

Contributors List

pp.:  12 – 16

Chapter 3. Lambda: the Ultimate Combinator

pp.:  42 – 62

Chapter 4. Proofs of Termination and the "91" Function

pp.:  62 – 80

Chapter 6. Robots with Common Sense?

pp.:  80 – 88

Chapter 7. Ascribing Artificial Intelligence to (Simpler) Machines, or When AI Meets the Real World

pp.:  88 – 106

Chapter 8. The Design of Parallel Programming Languages

pp.:  106 – 124

Chapter 9. Metaprogramming at Work in Automated Manufacturing

pp.:  124 – 144

Chapter 10.LISP + Calculus = Identities

pp.:  144 – 166

Chapter 11. Model Checking vs. Theorem Proving: A Manifesto

pp.:  166 – 192

Chapter 12. Algebraic Computation: The Quiet Revolution

pp.:  192 – 202

Chapter 13. LISP and Parallelism

pp.:  202 – 222

Chapter 14. Textbook Examples of Recursion

pp.:  222 – 246

Chapter 15. A Metalogic Programming Approach to Multi-Agent Knowledge and Belief

pp.:  246 – 262

Chapter 16. Belief and Introspection

pp.:  262 – 276

Chapter 17. Monotonicity Properties in Automated Deduction

pp.:  276 – 296

Chapter 18. Circumscription and Disjunctive Logic Programming

pp.:  296 – 320

Chapter 19. On the Equivalence of Data Representations

pp.:  320 – 346

Chapter 20. Caution! Robot Vehicle!

pp.:  346 – 360

Chapter 21. Circumscription and Authority

pp.:  360 – 374

Chapter 22. The Frame Problem in the Situation Calculus: A Simple Solution (Sometimes) and a Completeness Result for Goal Regression

pp.:  374 – 396

Chapter 23. An Abstraction Mechanism for Symbolic Expressions

pp.:  396 – 408

Chapter 24. Varieties of Context

pp.:  408 – 424

Chapter 25. The Influence of the Designeron the Design—J. McCarthyand LISP

pp.:  424 – 442

Chapter 26. Binding Structures

pp.:  442 – 464

Chapter 27. Logicism, AI, and Common Sense: John McCarthy'sProgram in Philosophical Perspective

pp.:  464 – 482

Chapter 28. The Incorrectness of the Bisection Algorithm

pp.:  482 – 484

Index

pp.:  484 – 489

The users who browse this book also browse