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 29
Page 135
A formula built by connecting two formulas with a → is called an implication . The
left - hand side of an implication is called the antecedent , and the right - hand
side is called the consequent . If both the antecedent and the consequent are wffs
...
A formula built by connecting two formulas with a → is called an implication . The
left - hand side of an implication is called the antecedent , and the right - hand
side is called the consequent . If both the antecedent and the consequent are wffs
...
Page 199
This restriction is a bit less severe than it appears because implications having
antecedents consisting of a disjunction of literals can be written as multiple rules ;
for example , the implication ( LI V L2 ) → W is equivalent to the pair of rules Ll ...
This restriction is a bit less severe than it appears because implications having
antecedents consisting of a disjunction of literals can be written as multiple rules ;
for example , the implication ( LI V L2 ) → W is equivalent to the pair of rules Ll ...
Page 404
The simplicity of the unit syntax makes representing implications that are much
more complex than those we have ... To use a network implication as a forward
rule , the ANTE structure ( regarded as a goal ) must match existing network fact ...
The simplicity of the unit syntax makes representing implications that are much
more complex than those we have ... To use a network implication as a forward
rule , the ANTE structure ( regarded as a goal ) must match existing network fact ...
What people are saying - Write a review
We haven't found any reviews in the usual places.
Contents
PROLOGUE | 1 |
PRODUCTION SYSTEMS AND AL | 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 backward block called chapter clauses CLEAR(C complete component condition conjunction 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 wff HANDEMPTY heuristic implication important initial instance involves JOHN knowledge labeled language literals logically 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 resolvent 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
Bibliographic information
| Title | Principles of Artificial Intelligence Symbolic computation |
| Author | Nils J. Nilsson |
| Edition | illustrated |
| Publisher | Tioga Publishing Company, 1980 |
| Original from | the University of Michigan |
| Digitized | 15 Nov 2007 |
| ISBN | 0935382011, 9780935382013 |
| Length | 476 pages |
| Export Citation | BiBTeX EndNote RefMan |