Principles of Artificial Intelligence
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.
Results 1-5 of 42
... symbol strings, vectors, sets, arrays, trees, and lists. Sometimes, as in the 8-puzzle, the form of the data structure bears a close resemblance to some physical property of the problem being solved. |. |. 2. 1. 8. 8|. 3. 3. 6|4|. TX. 4. 5.
... symbols is a sentence in a language; that is, could it have been generated by a grammar. Deciding whether a symbol ... symbols, of approves new president company sale the and the following non-terminal symbols, S NP VP PP P V DNP DET A N ...
... symbols is a sentence in the language: The president of the new company approves the sale To set up this problem, we specify the following: The global database shall consist of a string of symbols. The initial database is the given ...
... symbols by non-terminal symbols. DET N P DET A N V DET N | i DNP P DNP VP Another sequence produces the following string: DNP P S DNP PP VP Nothing more can be done to this string DNP VP Goal Fig. 1.7 A search tree for the syntax ...
... symbol M) is enclosed in a double box. Such nodes are called terminal nodes. (We could also have drawn the tree of Figure 1.10 as a graph. For example, the database (M, M) occurs as four nodes in Figure 1.10, and these could have been ...
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