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