Logic and the complexity of reasoning

What does logic have to do with computational approaches to the study of cognition? Very little, it would seem. For one thing, people (even trained logicians) are unquestionably very bad at it, compared to their skill at (say) reading or recognizing tunes. And computers have a hard time with it too: the computational activity that goes with logic, theorem proving of some sort, appears to be computationally intractable. Given its apparent difficulty, it seems quite unlikely that logic could be at the root of normal, everyday thinking. What I want to suggest here, however, is that rather than closing the book on logic (except perhaps as a mathematical tool for theoreticians so inclined), these facts force us into a less idealized view of logic, one that takes very seriously the idea that certain computational tasks are relatively easy, and others more difficult. In other words, it leads us to consider the computational complexity of logic in its application to cognition.

[1]  Alonzo Church,et al.  A note on the Entscheidungsproblem , 1936, Journal of Symbolic Logic.

[2]  Herbert A. Simon,et al.  The Sciences of the Artificial , 1970 .

[3]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[4]  R. Kowalski,et al.  Linear Resolution with Selection Function , 1971 .

[5]  Nuel D. Belnap,et al.  Entailment : the logic of relevance and necessity , 1975 .

[6]  J. Dunn,et al.  Intuitive semantics for first-degree entailments and ‘coupled trees’ , 1976 .

[7]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[8]  Allen Newell,et al.  The Knowledge Level , 1989, Artif. Intell..

[9]  Greg N. Carlson,et al.  Generic terms and generic sentences , 1982, J. Philos. Log..

[10]  Robert C. Moore The Role of Logic in Knowledge Representation and Commonsense Reasoning , 1982, AAAI.

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

[12]  Johan de Kleer,et al.  The Origin, Form, and Logic of Qualitative Physical Laws , 1983, IJCAI.

[13]  P. Johnson-Laird Mental models , 1989 .

[14]  Ronald J. Brachman,et al.  What IS-A Is and Isn't: An Analysis of Taxonomic Links in Semantic Networks , 1983, Computer.

[15]  Hector J. Levesque,et al.  The Tractability of Subsumption in Frame-Based Description Languages , 1984, AAAI.

[16]  Jean H. Gallier,et al.  Linear-Time Algorithms for Testing the Satisfiability of Propositional Horn Formulae , 1984, J. Log. Program..

[17]  Zenon W. Pylyshyn,et al.  Computation and Cognition: Toward a Foundation for Cognitive Science , 1984 .

[18]  Hector J. Levesque,et al.  A Logic of Implicit and Explicit Belief , 1984, AAAI.

[19]  Christos H. Papadimitriou,et al.  The complexity of recognizing polyhedral scenes , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[20]  Armin Haken,et al.  The Intractability of Resolution , 1985, Theor. Comput. Sci..

[21]  Leslie G. Valiant,et al.  NP is as easy as detecting unique solutions , 1985, STOC '85.

[22]  Peter Jackson,et al.  Introduction to expert systems , 1986 .

[23]  Hector J. Levesque,et al.  Making Believers out of Computers , 1986, Artif. Intell..

[24]  Dana H. Ballard,et al.  Cortical connections and parallel processing: Structure and function , 1986, Behavioral and Brain Sciences.

[25]  Patrick J. Hayes,et al.  A critique of pure treason , 1987 .

[26]  Robert C. Berwick,et al.  Computational complexity and natural language , 1987 .

[27]  Yishai A. Feldman,et al.  Algorithmics: The Spirit of Computing , 1987 .

[28]  Nimrod Megiddo,et al.  LINEAR PROGRAMMING (1986) , 1987 .

[29]  Allen Newell,et al.  SOAR: An Architecture for General Intelligence , 1987, Artif. Intell..

[30]  Hector J. Levesque,et al.  Taking Issue: Guest Editor's introduction 1 , 1987 .

[31]  Bart Selman,et al.  The Complexity of Model-Preference Default Theories , 1988, NMR.