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 Intelligence"evolved 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 86
Page
A Forward Deduction System 196 6 . 2 . A Backward ... Computation Deductions
and Program Synthesis 241 6 . 5 . A Combination Forward and Backward System
253 6 . 6 . Control Knowledge For Rule - Based Deduction Systems 257 6 . 7 .
A Forward Deduction System 196 6 . 2 . A Backward ... Computation Deductions
and Program Synthesis 241 6 . 5 . A Combination Forward and Backward System
253 6 . 6 . Control Knowledge For Rule - Based Deduction Systems 257 6 . 7 .
Page 269
Using deduction systems for intelligent information retrieval is discussed in
several papers in the volume by Gallaire and Minker ( 1978 ) . Wong and
Mylopoulos ( 1977 ) discuss the relationships between data models in database
...
Using deduction systems for intelligent information retrieval is discussed in
several papers in the volume by Gallaire and Minker ( 1978 ) . Wong and
Mylopoulos ( 1977 ) discuss the relationships between data models in database
...
Page 272
6 Show how RGR can be used in a backward deduction system to obtain a proof
for the goal wff : [ ( Ex ) ( Vy ) P ( x , y ) → ( Vy ) ( 3x ) P ( x , y ) ] 6 . 7 Propose a
heuristic search method to guide rule selection in rule - based deduction systems
.
6 Show how RGR can be used in a backward deduction system to obtain a proof
for the goal wff : [ ( Ex ) ( Vy ) P ( x , y ) → ( Vy ) ( 3x ) P ( x , y ) ] 6 . 7 Propose a
heuristic search method to guide rule selection in rule - based deduction systems
.
What people are saying - Write a review
We haven't found any reviews in the usual places.
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
achieve actions algorithm AND/OR graph answer applied arcs assertions assume attempt backtracking backward block called chapter clause CLEAR(C complete component condition consider consistent contains control strategy corresponding cost database deduction Deleters described direction discussed efficient evaluation example expanded expression F-rule fact Figure formula function given global database goal goal node goal stack goal wff HANDEMPTY heuristic important initial involves JOHN knowledge labeled language literals 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 unifying unit universal variables
Bibliographic information
| Title | Principles of Artificial Intelligence Symbolic computation |
| Author | Nils J. Nilsson |
| Edition | illustrated, reprint |
| Publisher | Morgan Kaufmann Publishers, 1986 |
| Original from | the University of Virginia |
| Digitized | 27 Jul 2009 |
| ISBN | 0934613109, 9780934613101 |
| Length | 476 pages |
| Subjects | › Reference / General |
| Export Citation | BiBTeX EndNote RefMan |