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 80
Page 65
... graph - searching algorithms . The procedure generates an explicit graph , G , called the search graph and a subset , T , of G called the search tree . Each node in G is also in T. The search tree is defined by the pointers that are set ...
... graph - searching algorithms . The procedure generates an explicit graph , G , called the search graph and a subset , T , of G called the search tree . Each node in G is also in T. The search tree is defined by the pointers that are set ...
Page 67
Nils J. Nilsson. graph and search tree shown in Figure 2.4 . The dark arrows along certain arcs in this search graph are the pointers that define parents of nodes in the search tree . The solid nodes ... search 67 GRAPH - SEARCH STRATEGIES.
Nils J. Nilsson. graph and search tree shown in Figure 2.4 . The dark arrows along certain arcs in this search graph are the pointers that define parents of nodes in the search tree . The solid nodes ... search 67 GRAPH - SEARCH STRATEGIES.
Page 69
... graph - search process generated only one successor at a time . Usually , the backtracking implementation is preferred to the depth - first version of GRAPHSEARCH because back- tracking is simpler to implement and involves less storage ...
... graph - search process generated only one successor at a time . Usually , the backtracking implementation is preferred to the depth - first version of GRAPHSEARCH because back- tracking is simpler to implement and involves less storage ...
Contents
PROLOGUE | 1 |
PRODUCTION SYSTEMS AND AI | 17 |
SEARCH STRATEGIES FOR | 53 |
Copyright | |
12 other sections not shown
Other editions - View all
Common terms and phrases
achieve actions algorithm AND/OR graph answer applied arcs Artificial Intelligence assume attempt backtracking backward block called chapter clause CLEAR CLEAR(C complete component condition consider consistent contains control strategy corresponding cost database deduction Deleters described direction discussed evaluation example expression F-rule fact Figure formula function given global database goal goal stack goal wff HANDEMPTY heuristic important initial involves JOHN knowledge labeled language literals logic 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 selected sequence shown in Figure simple solution graph solve specify statement step STRIPS structure subgoal substitutions successors Suppose symbols termination theorem unifying unit University variables