## 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 96

Page 127

Nils J. Nilsson. 3.5 . BIBLIOGRAPHICAL AND HISTORICAL REMARKS 3.5.1 .

Nils J. Nilsson. 3.5 . BIBLIOGRAPHICAL AND HISTORICAL REMARKS 3.5.1 .

**AND**/**OR GRAPHS**Decomposition and**AND**/**OR graphs**have been used in a variety of applications . Hinxman ( 1976 ) discusses applications to the " stock - cutting ...Page 199

...

...

**AND**/**OR graph**representations of goal wffs ; these are displayed in the usual manner , “ rightside up . ” When we represent wffs by**AND**/**OR graphs**, we are using**AND**/**OR graphs**for a quite different purpose than that described in ...Page 206

...

...

**AND**/**OR graph**, where L is a literal , W is a wff in AND / OR form , and all expressions might contain variables . The rule is applicable if the**AND**/**OR graph**contains a literal node L ' that unifies with L. Suppose the mgu is u ...### Contents

PROLOGUE | 1 |

PRODUCTION SYSTEMS AND AI | 17 |

SEARCH STRATEGIES FOR | 53 |

Copyright | |

10 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 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(A implication initial state description knowledge literal nodes logic methods monotone restriction natural language processing negation node labeled ONTABLE(A optimal path pickup(A precondition predicate calculus problem-solving procedure production system proof prove recursive regress represent representation resolution refutation result robot problem rule applications search graph search tree selected 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 universally quantified unstack(C,A variables WORKS-IN