A classic introduction to artificial intelligence intended to bridge the gap between theory and practice, Principles of Artificial Intelligence describes fundamental AI ideas that underlie applications such as natural language processing, automatic programming, robotics, machine vision, automatic theorem proving, and intelligent data retrieval. Rather than focusing on the subject matter of the applications, the book is organized around general computational concepts involving the kinds of data structures used, the types of operations performed on the data structures, and the properties of the control strategies used. Palo Alto, California: Tioga.

Classic Ph.D. dissertations by Randall Davis and Douglas Lenat, reprinted together in one volume. New York: McGraw-Hill.

This research was supported at SRI International by the Defense Advanced Research Projects Agency under contract N00039--79--C--0118 with the Naval Electronic Systems Command. The views and conclusions contained in this document are those of the author and should not be interpreted as representative of the official policies either expressed or implied of the Defense Advanced Research Projects Agency, or the U. S. Government. The author is grateful to Barbara Grosz, Gary Hendrix and Terry Winograd for comments on an earlier draft of this paper.

Truth maintenance systems have been used in several recent problem solving systems to record justifications for deduced assertions, to track down the assumptions which underlie contradictions when they arise, and to incrementally modify assertional data structures when assumptions are retracted. A TMS algorithm is described here that is substantially different from previous systems. This algorithm performs deduction in traditional propositional logic in such a way that the premise set from which deduction is being done can be easily manipulated. A novel approach is also taken to the role of a TMS in larger deductive systems. In this approach the TMS performs all propositional deduction in a uniform manner while the larger system is responsible for controlling the instantiation of universally quantified formulae and axiom schemas.

Thesis (Ph.D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1980.MICROFICHE COPY AVAILABLE IN ARCHIVES AND ENGINEERING.Includes bibliographical references.

Cambridge, Mass.: MIT Press. See also: An Overview of a Theory of Syntactic Recognition for Natural Language. MIT AIM-531. 1979 (http://dspace.mit.edu/handle/1721.1/6316).

Proc. AAAI-80, pp. 170-73.

American Journal of Computational Linguistics, Volume 6, Number 2, April-June 1980

In AAAI-80, pp. 102–104.

ACM Computing Survey 12:213-253