Artificial IntelligenceThe broad range of material included in these volumes suggests to the newcomer the nature of the field of artificial intelligence, while those with some background in AI will appreciate the detailed coverage of the work being done at MIT. The results presented are related to the underlying methodology. Each chapter is introduced by a short note outlining the scope of the problem begin taken up or placing it in its historical context. Contents, Volume I: Expert Problem Solving: Qualitative and Quantitative Reasoning in Classical Mechanics; Problem Solving About Electrical Circuits; Explicit Control of Reasoning; A Glimpse of Truth Maintenance; Design of a Programmer's Apprentice; Natural Language Understanding and Intelligent Computer Coaches: A Theory of Syntactic Recognition for Natural Language; Disambiguating References and Interpreting Sentence Purpose in Discourse; Using Frames in Scheduling; Developing Support Systems for Information Analysis; Planning and Debugging in Elementary Programming; Representation and Learning: Learning by Creating and Justifying Transfer Frames; Descriptions and the Specialization of Concept; The Society Theory of Thinking; Representing and Using Real-World Knowledge. |
Contents
PART | 1 |
CONTROLLING ATTENTION | 5 |
REPRESENTING KNOWLEDGE IN FRAMES | 7 |
Computers Can Do Geometric Analogy Intelligence Tests Computers Can Learn | 11 |
PROBLEMS TO THINK ABOUT | 17 |
The Rules Consist of a ThreePart Table Subfigure Relationships Are Simple Part 1 | 28 |
LEARNING SIMPLE DESCRIPTIONS | 29 |
EXPLOITING NATURAL CONSTRAINTS | 45 |
The Blocks World Has Been Studied for a Long Time KnowledgeGuided Tracking | 221 |
SCENE DESCRIPTION | 227 |
KNOWLEDGE ENGINEERING AND TEACHING PEOPLE | 235 |
ANALYZING MASS SPECTROGRAMS | 237 |
Children Can Teach Mechanical Turtles to Migrate Teaching Turtles to Migrate Helps | 250 |
BASIC LISP PROGRAMMING | 263 |
PROGRAMMING IN LISP | 275 |
DEFINE Creates New Functions Variables May Be Free or Bound Recursion Allows | 284 |
EXPLOITING CONSTRAINTS IN SENTENCE ANALYSIS | 71 |
Simple Sentences Focus on State Description and State Change The Case of a Noun Group | 83 |
BASIC SEARCH METHODS | 89 |
Depth First Searches Dive Deeply into the Search Tree BreadthFirst Searches Push | 96 |
LABEL PROPAGATION IN NETWORKS | 106 |
DEALING WITH ADVERSARIES | 112 |
CONTROL ISSUES | 130 |
SITUATIONACTION RULES AND PRODUCTION SYSTEMS | 143 |
THE MEANING OF MEANING | 157 |
Grammars Are Mechanisms for Describing Language Recursive Transition Nets Also | 175 |
NETWORKS AND FRAMES | 179 |
Minskys Theory of Frames Is a Theory of Rich Symbolic Structures Semantic Network | 190 |
Basic Primitives Can Represent Many Complicated Activities Conceptual Dependency | 197 |
POINTS OF VIEW ON VISION | 205 |
GET and PUTPROP Are the Masters of Property Lists PROG Creates Variables | 300 |
Programming Is Becoming Popular | 307 |
Basic Minimaxing Is Easy to Implement Move Generation and Minimaxing Can | 313 |
SYMBOLIC PATTERN MATCHING | 323 |
THE SIMULATED PSYCHIATRIST | 333 |
Satisfying an Augmented Transition Network Constitutes a Kind of Match Making LISP | 357 |
Functions LISP Is Best Defined in LISP Fancy Control Structures Usually Start | 371 |
MULTIPLE WORLDS | 386 |
FOR CHAPTER 2 | 395 |
FOR CHAPTER 7 | 408 |
FOR CHAPTER 14 | 422 |
INDEX | 439 |
Copyright | |