This is a preview of subscription content, log in via an institution to check access.
References
Anderson, A. and Belnap, N.: 1975, Entailment: The Logic of Relevance and Necessity. Princeton University Press, Princeton, NJ.
Ballard, D.: 1986. Cortical connections and parallel processing: structure and function. The Behavioral and Brain Sciences 9(1) 67–90.
Barton, G. E., Berwick, R. and Ristad, E.: 1987, Computational Complexity and Natural Language. MIT Press, Cambridge, MA.
Brachman, R.: 1983, What is-a is and isn't: an analysis of taxonomic links in semantic networks. IEEE Computer 16(10): 30–36.
Brachman, R. and Levesque, H.: 1984, The tractability of subsumption in frame-based description languages. In AAAI-84, pages 34–37, Austin, TX.
Carlson, G.: 1982, Generic terms and generic sentences. Journal of Philosophical Logic 11: 145–182.
Cherniak, C.: 1986, Minimal Rationality. Bradford Books, Cambridge, MA.
Church, A.: 1936, A note on the Entscheidungsproblem. The Journal of Symbolic Logic 1: 40–41.
Cooks, S.: 1971, The complexity of theorem proving procedures. In The 3rd. Annual Symposium on the Theory of Computing, pages 151–158, New York, NY.
de Kleer, J. and Brown, J. S.: 1983, The origin, form, and logic of qualitative physical laws. In IJCAI-83, pages 1158–1169, Karlsruhe, West Germany.
Dowling, W. and Gallier, J.: 1984, Linear-time algorithms for testing the satisfiability of propositional horn formulae. The Journal of Logic Programming 3: 267–284.
Dreyfus, H. and Dreyfus, S.: 1986, Mind over Machines. Macmillan, New York, NY.
Dunn, M.: 1976, Intuitive semantics for first-degree entailments and ‘coupled trees’. Philosophical Studies 29: 149–168.
Garey, M. and Johnson, D.: 1979, Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, San Francisco, CA.
Genesereth, M.: 1983, An overview of meta-level architecture. In AAAI-83, pages 119–124, Washington, D.C.
Haken, A.: 1985, The intractability of resolution. Theoretical Computer Science 39: 297–308.
Harel, D.: 1986, Algorithmics: The Spirit of Computing. Addison-Wesley, Don Mills, Ontario.
Hayes, P.: 1987, A critique of pure treason. Computational Intelligence 3(3): 179–185.
Jackson, P.: 1986, Introduction to Expert Systems. Addison-Wesley, Don Mills, Ontario.
Johnson-Laird, P.: 1983, Mental Models. Harvard University Press, Cambridge, MA.
Kirousis, L. and Papadimitriou, C.: 1985, The complexity of recognizing polyhedral scenes. In The 26th Annual Symposium on the Foundations of Computer Science, Portland, Oregon.
Kowalski, R. and Kuehner, D.: 1971, Linear resolution with selection functions. Artificial Intelligence 2: 227–260.
Kramer, B.: 1984, Representing control strategies using reflection. In CSCSI-84, pages 153–158, London, Ontario.
Laird, J. E., Newell, A., and Rosenbloom, P. S.: 1987, Soar: an architecture for general intelligence. Artificial Intelligence 33(1): 1–64.
Levesque, H.: 1984, A logic of implicit and explicit belief. In AAAI-84, pages 198–202, Austin, TX.
Levesque, H.: 1986a, Making believers out of computers. Artificial Intelligence 30(1): 81–108.
Levesque, H.: 1986b, Knowledge representation and reasoning. Annual Reviews of Computer Science 1: 255–287.
Levesque, H.: 1987, Taking issue: guest editor's introduction. Computational Intelligence 3(3): 149–150.
Megiddo, N.: 1987, Linear programming (1986). Annual Reviews of Computer Science 2: 119–145.
Moore, R.: 1982, The role of logic in knowledge representation and commonsense reasoning. In AAAI-82, pages 428–433, Pittsburgh, PA.
Newell, A.: 1982, The knowledge level. Artificial Intelligence 18(1): 87–127.
Patel-Schneider, P.: 1985, A decidable first-order logic for knowledge representation. In IJCAI-85, pages 455–458, Los Angeles, CA.
Pylyshyn, Z.: 1984, Computation and Cognition: Towards a Foundation for Cognitive Science. Bradford Books, Cambridge, MA.
Reiter, R.: 1978, On closed world databases. In Gallaire, H. and Minker, J., editors, Logic and Databases, pages 55–76, Plenum Press, New York, NY.
Reiter, R.: 1987, Nonmonotonic reasoning. Annual Reviews of Computer Science 2: 147–186.
Rumelhart, D. and McClelland, J. (editors): 1986, Parallel Distributed Processing. MIT Press, Cambridge, MA.
Selman, B. and Kautz, H.: 1988, The complexity of model-preference default theories. In CSCSI-88, Edmonton, Alberta.
Simon, H.: 1969. The Sciences of the Artificial. MIT Press, Cambridge, MA.
Tsotsos, J.: 1988, A complexity level analysis of immediate vision. International Journal of Computer Vision 4: 303–320.
Valiant, L. and Vazirani, V.: 1986, NP is as easy as detecting unique solutions. Theoretical Computer Science 47: 85–93.
Author information
Authors and Affiliations
Additional information
This paper is based on a seminar I gave in 1987 at York University, Carnegie Mellon University, Harvard University, the University of Western Ontario, and the University of California at San Diego. Thanks to my hosts at these institutions, and to all the others who attended the lecture and tried to keep me honest. Thanks also to Wolfgang Bibel, Ron Brachman, Tim Horton, David Israel, Joe Nunes, Ray Reiter, Jim des Rivières, Bart Selman, Rich Thomason, and John Tsotsos for reading an earlier draft and snaring several falsehoods. The ones that got away are not their fault, of course. Financial support was gratefully received from the Natural Sciences and Engineering Research Council of Canada.
Rights and permissions
About this article
Cite this article
Levesque, H.J. Logic and the complexity of reasoning. J Philos Logic 17, 355–389 (1988). https://doi.org/10.1007/BF00297511
Issue Date:
DOI: https://doi.org/10.1007/BF00297511