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 Intelligence evolved 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 71
Page viii
CHAPTER 4 : THE PREDICATE CALCULUS IN AI 131 4.1 . Informal Introduction to the Predicate Calculus 131 4.2 . Resolution 145 4.3 . The Use of the Predicate Calculus in AI 152 4.4 . Bibliographical and Historical Remarks 156 Exercises 156 ...
CHAPTER 4 : THE PREDICATE CALCULUS IN AI 131 4.1 . Informal Introduction to the Predicate Calculus 131 4.2 . Resolution 145 4.3 . The Use of the Predicate Calculus in AI 152 4.4 . Bibliographical and Historical Remarks 156 Exercises 156 ...
Page 9
OVERVIEW The book is divided into nine chapters and a prospectus . In chapter 1 , we introduce a generalized production system and emphasize its importance as a basic building block of Al systems . Several distinctions among production ...
OVERVIEW The book is divided into nine chapters and a prospectus . In chapter 1 , we introduce a generalized production system and emphasize its importance as a basic building block of Al systems . Several distinctions among production ...
Page 361
As we discussed in chapter 4 , there are many ways to represent a body of knowledge in the predicate calculus . The appropriateness of a representation depends on the application . After deciding on a particular form of representation ...
As we discussed in chapter 4 , there are many ways to represent a body of knowledge in the predicate calculus . The appropriateness of a representation depends on the application . After deciding on a particular form of representation ...
What people are saying - Write a review
We haven't found any reviews in the usual places.
Other editions - View all
Common terms and phrases
achieve actions algorithm AND/OR graph answer applied arcs assertions assume attempt backtracking backward block called chapter clause CLEAR(C complete component condition consider consistent contains control strategy corresponding cost database Deleters described direction discussed efficient evaluation example expanded expression F-rule fact Figure formula function given global database goal goal node goal stack goal wff HANDEMPTY heuristic important initial involves JOHN knowledge labeled language literals match methods move namely node Note obtained occur ONTABLE(A operation path possible precondition predicate calculus problem procedure production system proof prove quantified reasoning refutation represent representation resolution result robot rule satisfied search tree selected sequence shown in Figure simple solution graph solve specify statement step STRIPS structure subgoal substitutions successors Suppose symbols termination unifying unit universal variables