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 23
... unstack ( x , A ) we cannot , in general , prune it . Some. HOLDING ( B ) CLEAR ( C ) unstack ( B , y ) ONTABLE ( A ) pickup ( B ) ONTABLE ( B ) HANDEMPTY CLEAR ( B ) ON ( B.y ) CLEAR ( C ) CLEAR ( A ) ( #C ) ( #A ) unstack ( B.A ) CLEAR ( ...
... stack , it adjusts the position of the marker so that the marker is just above the next condition in the stack that still needs to be satisfied . After applying unstack ( C , A ) the goal stack is as follows : [ HANDEMPTY ^ CLEAR ( C ) ...
... ( C ) ^ ON ( C , A ) unstack ( C , A ) HOLDING ( C ) CLEAR ( B ) HOLDING ( C ) ^ CLEAR ( B ) stack ( C , B ) * ON ( C , B ) 4 Д [ HANDEMPTY ^ CLEAR ( A ) ^ ONTABLE ( A ) pickup ( A ) HOLDING ( A ) CLEAR ( C ) HOLDING ( A ) ^ CLEAR ( C ) stack ...
PRODUCTION Systems and AI
SEARCH Strategies FOR
10 other sections not shown