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 57
Page 38
... termination condition . That is , if we are to work on each component separately , we must be able to express the global termination condition using the termination conditions of each of the components . The most important case occurs ...
... termination condition . That is , if we are to work on each component separately , we must be able to express the global termination condition using the termination conditions of each of the components . The most important case occurs ...
Page 115
... termination is feasible . A gross estimate of the size of the tic - tac - toe game tree , for example , can be obtained by noting that the start node has nine successors , these in turn have eight , etc. , yielding 9 ! ( or 362,880 ) ...
... termination is feasible . A gross estimate of the size of the tic - tac - toe game tree , for example , can be obtained by noting that the start node has nine successors , these in turn have eight , etc. , yielding 9 ! ( or 362,880 ) ...
Page 254
... termination condition . Termination must involve the proper kind of abutment between the two graph structures . These structures can be joined by match edges at nodes labeled by literals that unify . We label the match edges themselves ...
... termination condition . Termination must involve the proper kind of abutment between the two graph structures . These structures can be joined by match edges at nodes labeled by literals that unify . We label the match edges themselves ...
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
8-puzzle achieve actions Adders AI production 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 global database goal expression goal node goal stack goal wff graph-search HANDEMPTY heuristic HOLDING(B implication initial state description knowledge leaf nodes literal nodes logic negation node labeled ONTABLE(A optimal path pickup(A precondition predicate calculus problem-solving procedure production system proof prove recursive regress represent representation result robot problem rule applications search graph search tree selected semantic network sequence shown in Figure Skolem function solution graph solve SRI International stack(A STRIPS structure subgoal substitutions successors Suppose symbols termination condition theorem theorem-proving tip nodes unifying composition universally quantified unstack(C,A variables WORKS-IN