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 82
Page xi
... contains many additional topics such as rule - based systems , robot problem - solving systems , and structured - object representations . One of the goals of this book is to fill a gap between theory and practice . Al theoreticians ...
... contains many additional topics such as rule - based systems , robot problem - solving systems , and structured - object representations . One of the goals of this book is to fill a gap between theory and practice . Al theoreticians ...
Page 6
... containing n nodes such that the path visits each of the n nodes precisely once . Many puzzles have this same general character . Another example is the 8 - queens problem , where the problem is to place eight queens on a standard ...
... containing n nodes such that the path visits each of the n nodes precisely once . Many puzzles have this same general character . Another example is the 8 - queens problem , where the problem is to place eight queens on a standard ...
Page 9
... contain the knowledge that windows typically do not touch the floor . A special detector , applied to the scene , confirms this expectation , thus raising confidence in the window hypothesis . We discuss some of the fun- damental ideas ...
... contain the knowledge that windows typically do not touch the floor . A special detector , applied to the scene , confirms this expectation , thus raising confidence in the window hypothesis . We discuss some of the fun- damental ideas ...
Page 11
... contains many references . Michie's ( 1974 ) book contains several of his articles on AI . Raphael's ( 1975 ) book and Winston's ( 1977 ) book are easy - to - read and elementary treatments of Al ideas . The latter contains an excellent ...
... contains many references . Michie's ( 1974 ) book contains several of his articles on AI . Raphael's ( 1975 ) book and Winston's ( 1977 ) book are easy - to - read and elementary treatments of Al ideas . The latter contains an excellent ...
Page 12
... contain several important papers . Work in language processing draws on several disciplines besides AI- most ... contains several descriptions of systems for querying databases using simplified natural language . 0.3.3 . EXPERT ...
... contain several important papers . Work in language processing draws on several disciplines besides AI- most ... contains several descriptions of systems for querying databases using simplified natural language . 0.3.3 . EXPERT ...
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 |
Other editions - View all
Common terms and phrases
8-puzzle achieve actions Adders algorithm AND/OR graph applied Artificial Intelligence atomic formula backed-up value backtracking backward block breadth-first breadth-first search called chapter clause form CLEAR(C component contains control regime control strategy cost DCOMP Deleters delineation depth-first search described discussed disjunction domain element-of evaluation function example existentially quantified F-rule formula frame problem game tree global database goal expression goal node goal stack goal wff graph-search HANDEMPTY heuristic HOLDING(A implication initial state description knowledge leaf nodes literal nodes logic methods monotone restriction negation node labeled ONTABLE(A optimal path pickup(A precondition predicate calculus problem-solving procedure production rules production system proof prove recursive regress represent representation resolution refutation result robot problem rule applications search graph search tree semantic network sequence shown in Figure Skolem function solution graph solve stack(A STRIPS structure subgoal substitutions successors Suppose symbols termination condition theorem theorem-proving tip nodes unifying composition universally quantified