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 6-10 of 31
satisfies the termination condition. Notice that we can use the distance chart of Figure 1.5 to compute the total distance for any trip. Any trip proposed as a solution must be of minimal distance. Figure 1.6 shows part of the search ...
... applicable to a database in different ways, corresponding to different occurrences of the left-hand side of the grammar rule in the database. Only that database consisting of the single symbol S satisfies the termination condition.
In this type of search, the termination condition to be used by the control system (to decide when the problem is solved) must be stated as some type of matching condition between the state description part and the goal description part ...
Consider, for example, a system whose initial database is (C, B, Z), whose production rules are based on the following rewrite rules, R1 : C → (D, L.) R2: C → (B, M) R3: B – (M, M) R4: Z-> (B, B, M) and whose termination condition is ...
If the applicability conditions of the rules involve tests on individual atoms only, and if the effects of the rules are to substitute a ... In order to decompose a database, we must also be able to decompose the termination condition.
What people are saying - Write a review
CHAPTER 3 SEARCH STRATEGIES FOR DECOMPOSABLE PRODUCTION SYSTEMS
CHAPTER 4 THE PREDICATE CALCULUS IN AI
CHAPTER 5 RESOLUTION REFUTATION SYSTEMS
CHAPTER 6 RULEBASED DEDUCTION SYSTEMS
CHAPTER 7 BASIC PLANGENERATING SYSTEMS
CHAPTER 8 ADVANCED PLANGENERATING SYSTEMS
CHAPTER 9 STRUCTURED OBJECT REPRESENTATIONS