Table of Contents
Series Foreword
1. Preface
1.1 The role of this book
1.2 About the programs
1.3 Obtaining the programs
1.4 Feedback
1.5 About the eXercises
1.6 Acknowledgments
2. Introduction
2.1 Comparing Al reasoning systems to conventional programs
2.2 Phases of Al programming
2.3 Outline of the book
3. Classical Problem Solving
3.1 The problem space model
3.2 CPS design
3.3 CPS implementation issues
3.4 The CPS implementation
3.5 Navigating the Boston subway
3.6 Solving algebra problems
3.7 Sic transit gloria search?
3.8 Backpointers
3.9 EXercises
3.10 Bibliography
4. PatternDirected Inference Systems
4.1 The patterndirected inference system model
4.2 The design of TRE
4.3 The implementation of TRE
4.4 Natural deduction
4.5 Conclusions
4.6 Backpointers 1
4.7 EXercises
4.8 Bibliography
5. EXtending PatternDirected Inference Systems
5.1 Designing for convenience, efficiency, and power
5.2 Implementing FTRE
5.3 EXamples
5.4 Reprise
5.5 Backpointers
5.6 EXercises
5.7 Bibliography
6. Introduction to Truth Maintenance Systems
6.1 Why use a TMS?
6.2 What is a TMS?
6.3 The basics of truth maintenance systems
6.4 How justifications help
6.5 The propositional specification of a TMS
6.6 Families of TMSs
6.7 EXercises
6.8 Bibliography
7. JustificationBased Truth Maintenance Systems
7.1 JTMS node properties
7.2 The propositional specification of a JTMS
7.3 Wellfounded support
7.4 In and out versus true and false
7.5 How justifications save inference engine work
7.6 How justifications enable default reasoning
7.7 The JTMS interface
7.8 Simple eXampleof JTMS usage
7.9 The JTMS algorithms
7.10 JTMS code
7.11 EXercises
8. Putting the JTMS to Work
8.1 Interfacing a JTMS to an inference engine: Issues
8.2 The design of JTRE
8.3 Implementing JTRE
8.4 EXample: Dependencydirected search
8.5 EXample: Reconstructing SAINT
8.6 Summary
8.7 Backpointers
8.8 EXercises
8.9 Bibliography
9. LogicBased Truth Maintenance Systems
9.1 Why reasoning about negation is important
9.2 LTMS basics
9.3 Boolean constraint propagation
9.4 Encoding propositional formulas as clauses
9.5 The logical properties of BCP
9.6 Search
9.7 The LTMS interface
9.8 A simple eXample of LTMS usage
9.9 The BCP algorithm
9.10 The LTMS code
9.11 EXercises
9.12 Bibliography
10. Putting an LTMS to Work
10.1 The design of LTRE
10.2 The implementation of LTRE
10.3 An indirect proof mechanism
10.4 Closedworld assumptions
10.5 A dependencydirected search facility
10.6 Backpointers
10.7 EXercises
10.8 Bibliography
11. Implementing Qualitative Process Theory
11.1 A problem: Measurement interpretation
11.2 AQP theory primer
11.3 The design of TGIZMO
11.4 The implementation of TGIZMO
11.5 EXamples
11.6 Backpointers
11.7 EXercises
11.8 Bibliography
12. AssumptionBased Truth Maintenance Systems
12.1 ATMS basics
12.2 ATMS algorithms
12.3 Constructing solutions
12.4 The ATMS interface
12.5 Simple eXample of ATMS usage
12.6 EXercises
12.7 Bibliography
13. Improving the Completeness of Truth Maintenance Systems
13.1 EXtending BCP to formulas
13.2 A complete LTMS
13.3 Application to ATMS
13.4 Improving the efficiency of prime implicate construction
13.5 The full LTMS interface
13.6 A simple eXample of CLTMS usage
13.7 The full LTMS code
13.8 EXercises
13.9 Bibliography
14. Putting the ATMS to Work
14.1 Interfacing to an ATMS
14.2 Implementing ATRE
14.3 Building a planner
14.4 Using an ATMS in focused problem solving
14.5 Backpointers
14.6 EXercises
14.7 Bibliography
15. Antecedent Constraint Languages
15.1 The constraint model
15.2 The TCON constraint language
15.3 Implementing TCON
15.4 EXamples
15.5 EXtending the TCON model
15.6 Backpointers
15.7 EXercises
15.8 Bibliography
16. AssumptionBased Constraint Languages
16.1 The ATCON language
16.2 Comparison of TCON and ATCON
16.3 The ATCON interface
16.4 The ATCON code
16.5 EXercises
16.6 Bibliography
17. A Tiny Diagnosis Engine
17.1 EXample
17.2 Implementation
17.3 Sequential diagnosis
17.4 A formalization of modelbased diagnosis
17.5 EXercises
17.6 Bibliography
18. Symbolic RelaXation Systems
18.1 Constraint satisfaction problems
18.2 Constraint networks and finite CSPs
18.3 The WALTZER constraint engine
18.4 EXample: Scene labeling
18.5 EXample: Temporal reasoning
18.6 Discussion
18.7 Backpointers
18.8 EXercises
18.9 Bibliography
19. Some Frontiers
19.1 Constraint logic programming
19.2 Scaling up
19.3 Embedding
19.4 Integrated architectures
19.5 Cognitive modeling
19.6 Bibliography
A. Putting the Programs to Work
A.1 Organizing the files
A.2 A guide to the utility programs
IndeX
