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 24
... unstack , to this state to achieve a state that matches the goal expression , CLEAR ( A ) . A final example illustrates how we might generate " impossible " subgoal descriptions . Suppose we attempt to apply the B - rule version of unstack ...
... unstack ( B , y ) , ONTABLE ( B ) ONTABLE ( A ) CLEAR ( A ) HANDEMPTY unstack ( B , C ) HANDEMPTY CLEAR ( B ) CLEAR ( B ) ON ( B.y ) CLEAR ( C ) ON ( B , C ) CLEAR ( A ) ( y + C ) ( ' #A ) ONTABLE ( A ) unstack ( B.A ) CLEAR ( A ) ...
... unstack ( C , A ) , can be applied is as follows : [ HANDEMPTY ^ CLEAR ( C ) ^ ON ( C , y ) unstack ( C , y ) HOLDING ( C ) CLEAR ( B ) _HOLDING ( C ) ^ CLEAR ( B ) stack ( C , B ) ON ( C , B ) ON ( A , C ) _ON ( C , B ) ^ ON ( A , C ) ...
Contents
PROLOGUE | 1 |
PRODUCTION SYSTEMS AND AI | 17 |
SEARCH STRATEGIES FOR | 53 |
Copyright | |
10 other sections not shown