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-5 of 89
Page 17
... rules , and a control system . The global database is the central data structure used by an Al production system . Depending on the application , this database may be as simple as a ... PRODUCTION SYSTEMS AND AI 1.1. Production Systems.
... rules , and a control system . The global database is the central data structure used by an Al production system . Depending on the application , this database may be as simple as a ... PRODUCTION SYSTEMS AND AI 1.1. Production Systems.
Page 18
Nils J. Nilsson. The production rules operate on the global database . Each rule has a precondition that is either satisfied or not by the global database . If the precondition is satisfied , the rule can be applied . Application of the ...
Nils J. Nilsson. The production rules operate on the global database . Each rule has a precondition that is either satisfied or not by the global database . If the precondition is satisfied , the rule can be applied . Application of the ...
Page 19
... production system , we must specify the global database , the rules , and the control strategy . Transforming a problem statement into these three components of a production system is often called the representation problem in AI ...
... production system , we must specify the global database , the rules , and the control strategy . Transforming a problem statement into these three components of a production system is often called the representation problem in AI ...
Page 20
... production rules that operate on the state descriptions in the appropriate manner . The rules each have preconditions that must be satisfied by a state description in order for them to be applicable to that state description . Thus ...
... production rules that operate on the state descriptions in the appropriate manner . The rules each have preconditions that must be satisfied by a state description in order for them to be applicable to that state description . Thus ...
Page 21
Nils J. Nilsson. Procedure PRODUCTION 1 DATA initial database 2 until DATA satisfies the termination condition , do : 3 begin 4 5 6 select some rule , R , in the set of rules that can be applied to DATA DATA result of applying R to DATA ...
Nils J. Nilsson. Procedure PRODUCTION 1 DATA initial database 2 until DATA satisfies the termination condition , do : 3 begin 4 5 6 select some rule , R , in the set of rules that can be applied to DATA DATA result of applying R to DATA ...
Contents
1 | |
17 | |
53 | |
CHAPTER 3 SEARCH STRATEGIES FOR DECOMPOSABLE PRODUCTION SYSTEMS | 99 |
CHAPTER 4 THE PREDICATE CALCULUS IN AI | 131 |
CHAPTER 5 RESOLUTION REFUTATION SYSTEMS | 161 |
CHAPTER 6 RULEBASED DEDUCTION SYSTEMS | 193 |
CHAPTER 7 BASIC PLANGENERATING SYSTEMS | 275 |
CHAPTER 8 ADVANCED PLANGENERATING SYSTEMS | 321 |
CHAPTER 9 STRUCTURED OBJECT REPRESENTATIONS | 361 |
PROSPECTUS | 417 |
BIBLIOGRAPHY | 429 |
AUTHOR INDEX | 467 |
SUBJECT INDEX | 471 |
Other editions - View all
Common terms and phrases
8-puzzle achieve actions Adders algorithm AND/OR graph applied Artificial Intelligence atomic formula backed-up value backtracking backward block breadth-first breadth-first search called chapter clause form CLEAR(C component contains control regime control strategy cost DCOMP Deleters delineation depth-first search described discussed disjunction domain element-of evaluation function example existentially quantified F-rule formula frame problem game tree global database goal expression goal node goal stack goal wff graph-search HANDEMPTY heuristic HOLDING(A implication initial state description knowledge leaf nodes literal nodes logic methods monotone restriction negation node labeled ONTABLE(A optimal path pickup(A precondition predicate calculus problem-solving procedure production rules production system proof prove recursive regress represent representation resolution refutation result robot problem rule applications search graph search tree semantic network sequence shown in Figure Skolem function solution graph solve stack(A STRIPS structure subgoal substitutions successors Suppose symbols termination condition theorem theorem-proving tip nodes unifying composition universally quantified