| |
| |
| |
Representations and Methods | |
| |
| |
| |
The Intelligent Computer | |
| |
| |
The Field and the Book | |
| |
| |
This Book Has Three Parts | |
| |
| |
What Artificial Intelligence Can Do | |
| |
| |
Criteria for Success | |
| |
| |
Summary Background | |
| |
| |
| |
Semantic Nets and Description Matching | |
| |
| |
Semantic Nets | |
| |
| |
The Describe-and-Match Method | |
| |
| |
The Describe-and-Match Method and Analogy Problems | |
| |
| |
The Describe-and-Match Method and Recognition of Abstractions | |
| |
| |
Problem Solving and Understanding Knowledge | |
| |
| |
Summary | |
| |
| |
Background | |
| |
| |
| |
Generate and Test, Means-End Analysis, and Problem Reduction | |
| |
| |
The Generate-and-Test Method | |
| |
| |
The Means-Ends Analysis Method | |
| |
| |
The Problem-Reduction Method | |
| |
| |
Summary | |
| |
| |
Background | |
| |
| |
| |
Nets and Basic Search eI Nets and Optimal Search | |
| |
| |
Blind Methods | |
| |
| |
Heuristically Informed Methods | |
| |
| |
Summary | |
| |
| |
Background | |
| |
| |
| |
Nets and Optimal Search | |
| |
| |
The Best PathRedundant Paths | |
| |
| |
Summary | |
| |
| |
Background | |
| |
| |
| |
Trees and Adversarial Search | |
| |
| |
Algorithmic Methods | |
| |
| |
Heuristic Methods | |
| |
| |
Summary | |
| |
| |
Background | |
| |
| |
| |
Rules and Rule Chaining | |
| |
| |
Rule-Based Deduction Systems | |
| |
| |
Rule-Based Reaction Systems | |
| |
| |
Procedures for Forward and Backward Chaining | |
| |
| |
Summary | |
| |
| |
Background | |
| |
| |
| |
Rules, Substrates, and Cognitive Modeling | |
| |
| |
Rule-Based Systems Viewed as Substrate | |
| |
| |
Rule-Based Systems Viewed as Models for Human Problem Solving | |
| |
| |
Summary | |
| |
| |
Background | |
| |
| |
| |
Frames and Inheritance | |
| |
| |
Frames, Individuals, and Inheritance | |
| |
| |
Demon ProceduresFrames, Events, and Inheritance | |
| |
| |
Summary | |
| |
| |
Background | |
| |
| |
| |
Frames and Commonsense | |
| |
| |
Thematic-role Frames | |
| |
| |
Examples Using Take Illustrate How Constraints Interact | |
| |
| |
Expansion into Primitive Actions | |
| |
| |
Summary | |
| |
| |
Background | |
| |
| |
| |
Numeric Constraints and Propagation | |
| |
| |
Propagation of Numbers Through Numeric Constraint Nets | |
| |
| |
Propagation of Probability Bounds Through Opinion Nets | |
| |
| |
Propagation of Surface Altitudes Through Arrays | |
| |
| |
Summary | |
| |
| |
Background | |
| |
| |
| |
Symbolic Constraints and Propagation | |
| |
| |
Propagation of Line Labels through Drawing Junctions | |
| |
| |
Propagation of Time-Interval Relations | |
| |
| |
Five Points of Methodology | |
| |
| |
Summary | |
| |
| |
Background | |
| |
| |
| |
Logic and Resolution Proof | |
| |
| |
Rules of Inference | |
| |
| |
Resolution Proofs | |
| |
| |
Summary | |
| |
| |
Background | |
| |
| |
| |
Backtracking and Truth Maintenance | |
| |
| |
Chronological and Dependency-Directed Backtracking | |
| |
| |
Proof by Constraint Propagation | |
| |
| |
Summary | |
| |
| |
Background | |
| |
| |
| |
Planning | |
| |
| |
Planning Using If-Add-Delete Operators | |
| |
| |
Planning Using Situation Variables | |
| |
| |
Summary | |
| |
| |
Background | |
| |
| |
| |
Learning and Regularity Recognition | |
| |
| |
| |
Learning by Analyzing Differences | |
| |
| |
Induction Heuristics | |
| |
| |
Identification | |
| |
| |
Summary | |
| |
| |
Background | |
| |
| |
| |
Learning by Explaining Experience | |
| |
| |
Learning about Why People Act the Way they Do | |
| |
| |
Learning about Form and function | |
| |
| |
Matching | |
| |
| |
Summary | |
| |
| |
Background | |
| |
| |
| |
Learning by Correcting Mistakes | |
| |
| |
Isolating Suspicious Relations | |
| |
| |
Intelligent Knowledge Repair | |
| |
| |
Summary | |
| |
| |
Backg | |