Principles of Artificial IntelligenceA 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 28
Nils J. Nilsson. Rules can be applied to component databases. Nodes labeled by these component databases have ... node corresponding to a component database satisfying the termination condition (in this case consisting of the symbol M) is ...
... nodes are labeled by databases, and the arcs are labeled by rules. If an arc is directed from node n, to node n, then node n; is said to be a successor of node n, and node n, is said to be aparent of node n, . In the graphs that are of ...
... nodes labeled by the same database. Node repetitions, of course, lead to redundant successor computations. Hence, there is a tradeoff between the computational cost of testing for matching databases and the computational cost of ...
... node; they do not save the entire record of the search as do depth-first graph-search strategies.) The search tree generated by a depth-first search process in an 8-puzzle problem is illustrated in Figure 2.6. The nodes are labeled with ...
You have reached your viewing limit for this book.
Contents
1 | |
17 | |
53 | |
CHAPTER 3 SEARCH STRATEGIES FOR DECOMPOSABLE PRODUCTION SYSTEMS | 99 |
CHAPTER 4 THE PREDICATE CALCULUS IN AI | 131 |
CHAPTER 5 RESOLUTION REFUTATION SYSTEMS | 161 |
CHAPTER 6 RULEBASED DEDUCTION SYSTEMS | 193 |
CHAPTER 7 BASIC PLANGENERATING SYSTEMS | 275 |
CHAPTER 8 ADVANCED PLANGENERATING SYSTEMS | 321 |
CHAPTER 9 STRUCTURED OBJECT REPRESENTATIONS | 361 |
PROSPECTUS | 417 |
BIBLIOGRAPHY | 429 |
AUTHOR INDEX | 467 |
SUBJECT INDEX | 471 |