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
... ( C ) 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 ) ...
... stack portion of the global database produced by RSTRIPS at the time that the first F - rule , namely , unstack ( C , A ) , can be applied is as follows : [ HANDEMPTY ^ CLEAR ( C ) ^ ON ( C , y ) unstack ( C , y ) HOLDING ( C ) CLEAR ( B ) ...
Nils J. Nilsson. tion achieved after applying unstack ( C , A ) . Regressing CLEAR ( B ) through this F - rule produces CLEAR ( B ) , which matches the initial state description , so , therefore , it must also match the subsequent ...
Contents
PROLOGUE | 1 |
PRODUCTION SYSTEMS AND AI | 17 |
SEARCH STRATEGIES FOR | 53 |
Copyright | |
10 other sections not shown