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 82
... goal expressions . ) Goal literals ( as well as rules ) can be used to add descendants to the AND / OR graph . When one of the goal literals matches a literal labeling a literal node , n , of the graph , we add a new descendant of node ...
... GOAL ( WORKS - IN ? x ? u ) . Here we have a match against F2 with ? x bound to P - D and ? u bound to JOE - SMITH . Following the sequence of Figure 6.32 , we next meet : GOAL ( MANAGER P - D ? v ) . This statement matches F1 , binding ...
... goal above the compound goal in the goal stack . A reasonable approach is first to find all of those components that match the current state description . ( Conceptually , they are put on the top of the stack and then immediately ...
PRODUCTION Systems and AI
SEARCH Strategies FOR
10 other sections not shown