Logic, Problem Solving, and Deduction

1. Many problems are statable as logic puzzles. There are many examples in Wos et al (1984). 2. Mathematical reasoning is itself a fonn of problem solving, and deduc­ tion is the ultimate justification of mathematical belief. 3. Some problems, while not formulated from the start as logic problems, might be expressible in that form with some work. Then the techniques of deduction could be used to solve them. 4. Many reasoning programs require large quantities of "knowledge" (Feigenbaum 1977). This knowledge is often hard to express formally, and logic provides tools for doing so.

[1]  Larry Wos,et al.  Automated Reasoning: Introduction and Applications , 1984 .

[2]  J. A. Robinson,et al.  A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.

[3]  Richard C. T. Lee,et al.  Symbolic logic and mechanical theorem proving , 1973, Computer science classics.

[4]  Kenneth Kunen,et al.  Completeness Results for Inequality Provers , 1985, Artif. Intell..

[5]  Drew McDermott,et al.  Non-Monotonic Logic I , 1987, Artif. Intell..

[6]  W. W. Bledsoe,et al.  Variable Elimination and Chaining in a Resolution-based Prover for Inequalities , 1980, CADE.

[7]  Raymond Reiter,et al.  A Theory of Diagnosis from First Principles , 1986, Artif. Intell..

[8]  Patrick J. Hayes,et al.  A Common-Sense Theory of Time , 1985, IJCAI.

[9]  Lawrence J. Henschen,et al.  Questions concerning possible shortest single axioms for the equivalential calculus: an application of automated theorem proving to infinite domains , 1983, Notre Dame J. Formal Log..

[10]  Robert C. Moore.  A Formal Theory of Knowledge and Action , 1984 .

[11]  Neil V. Murray.  Completely Non-Clausal Theorem Proving , 1982, Artif. Intell..

[12]  Christoph Walther.  A Mechanical Solution of Schubert's Steamroller by Many-Sorted Resolution , 1984, AAAI.

[13]  Robert E. Mercer,et al.  On the adequacy of predicate circumscription for closed‐world reasoning , 1985, Comput. Intell..

[14]  D. McDermott.  A Temporal Logic for Reasoning About Processes and Plans , 1982, Cogn. Sci..

[15]  Robert A. Kowalski,et al.  A Proof Procedure Using Connection Graphs , 1975, JACM.

[16]  Scott E. Fahlman,et al.  NETL: A System for Representing and Using Real-World Knowledge , 1979, CL.

[17]  Michael R. Genesereth,et al.  An Overview of Meta-Level Architecture , 1983, AAAI.

[18]  Edward A. Felgenbaum.  The art of artificial intelligence: themes and case studies of knowledge engineering , 1977, IJCAI 1977.

[19]  M. Resnik,et al.  Aspects of Scientific Explanation. , 1966 .

[20]  Malcolm C. Harrison,et al.  Equality-based binary resolution , 1986, JACM.

[21]  Stuart J. Russell,et al.  The compleat guide to MRS , 1985 .

[22]  Drew McDermott,et al.  Default Reasoning, Nonmonotonic Logics, and the Frame Problem , 1986, AAAI.

[23]  John McCarthy,et al.  SOME PHILOSOPHICAL PROBLEMS FROM THE STANDPOINT OF ARTI CIAL INTELLIGENCE , 1987 .

[24]  Mark E. Stickel,et al.  A Hole in Goal Trees: Some Guidance from Resolution Theory , 1973, IEEE Transactions on Computers.

[25]  Robert C. Moore,et al.  Formal Theories of the Commonsense World , 1985 .

[26]  Natarajan Shankar,et al.  A mechanical proof of the Church-Rosser theorem , 1988, JACM.

[27]  Drew McDermott.  The DUCK Manual. , 1985 .

[28]  Henry A. Kautz.  The Logic of Persistence , 1986, AAAI.

[29]  Michael R. Genesereth,et al.  The Use of Design Descriptions in Automated Diagnosis , 1984, Artif. Intell..

[30]  Patrick J. Hayes,et al.  Naive physics I: ontology for liquids , 1989 .

[31]  Jerry R. Hobbs.  Commonsense summer : final report , 1985 .

[32]  Yoav Shoham,et al.  Reified Temporal Logics: Semantical and Ontological Considerations , 1986, ECAI.

[33]  Vladimir Lifschitz,et al.  Closed-World Databases and Circumscription , 1987, Artif. Intell..