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-3 of 63
... clause . Recall that ( x ) [ P ( x ) ^ Q ( x ) ] is equivalent to [ ( Vx ) P ( x ) ^ ( ˇy ) Q ( y ) ] . This process is sometimes called standardizing the variables apart . Our clauses are now : ~ P ( x1 ) V ~ P ( y ) ▽ P [ f ( x1 , y ) ...
... clauses { L ; } and { M1 } resolve and that the new clause , { { Li } - { l } } s U { { Mi } - { mi } } s , is a resolvent of the two clauses . If two clauses resolve , they may have more than one resolvent because there may be more ...
... clauses can be evaluated , but the clause set can nevertheless be simplified by such evaluations . If a literal in a clause evaluates to T , the entire clause can be eliminated without affecting the unsatisfiability of the rest of the ...
Contents
PROLOGUE | 1 |
PRODUCTION SYSTEMS AND AI | 17 |
SEARCH STRATEGIES FOR | 53 |
Copyright | |
10 other sections not shown