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-3 of 30
... clause 1 , say , and using it and its descendants in resolutions . We can resolve clauses 1 and 3 to produce ~ S V ... form . If we look at our original goal , namely , to prove P ^ ( Q ▽ R ) , it is obvious that the component P needs ...
... clause form of the fact expression . ) We intend that the graph resulting after rule application represent both the ... clause form of F ( W ) . This set of clauses includes the entire set that would be produced by performing all ...
... clause form , and added to the clause form of the assertions . Duality between assertions and goals allows the negated goal to be treated as if it were an assertion . Resolution refutation systems apply resolution to the combined set of ...
PRODUCTION Systems and AI
SEARCH Strategies FOR
10 other sections not shown