Principles of Artificial Intelligence
Morgan Kaufmann, Jun 28, 2014 - Computers - 476 pages
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.
Principles of Artificial Intelligenceevolved from the author's courses and seminars at Stanford University and University of Massachusetts, Amherst, and is suitable for text use in a senior or graduate AI course, or for individual study.
From inside the book
Results 1-5 of 45
Pertinent references are briefly discussed at the end of every chapter. These citations should provide the interested student with adequate entry points to much of the most important literature in the field. I look forward someday to ...
Many of these problems can be attacked by the methods discussed in this book. A classical example is the traveling salesman's problem, where the problem is to find a minimum distance tour, starting at one of several cities, ...
Systems for proving theorems using resolution are discussed in chapter 5. We indicate how several different kinds of problems can be posed as theorem-proving problems. Chapter 6 examines some of the inadequacies of simple resolution ...
[See also the discussion by Constable (1979) in the same volume.] The formal verification of properties of programs was discussed early in the history of computing by Goldstine and von Neumann (1947) and by Turing (1950).
... refers to more specialized types of computational systems than those discussed in this book. Production systems derive from a computational formalism proposed by Post (1943) that was based on string replacement rules.
What people are saying - Write a review
CHAPTER 3 SEARCH STRATEGIES FOR DECOMPOSABLE PRODUCTION SYSTEMS
CHAPTER 4 THE PREDICATE CALCULUS IN AI
CHAPTER 5 RESOLUTION REFUTATION SYSTEMS
CHAPTER 6 RULEBASED DEDUCTION SYSTEMS
CHAPTER 7 BASIC PLANGENERATING SYSTEMS
CHAPTER 8 ADVANCED PLANGENERATING SYSTEMS
CHAPTER 9 STRUCTURED OBJECT REPRESENTATIONS