Building Problem Solvers, Volume 1
For nearly two decades, Kenneth Forbus and Johan de Kleer have accumulated a substantial body of knowledge about the principles and practice of creating problem solvers. In some cases they are the inventors of the ideas or techniques described, and in others, participants in their development.
Building Problem Solvers communicates this knowledge in a focused, cohesive manner. It is unique among standard artificial intelligence texts in combining science and engineering, theory and craft to describe the construction of AI reasoning systems, and it includes code illustrating the ideas.
After working through Building Problem Solvers, readers should have a deep understanding of pattern directed inference systems, constraint languages, and truth maintenance systems. The diligent reader will have worked through several substantial examples, including systems that perform symbolic algebra, natural deduction, resolution, qualitative reasoning, planning, diagnosis, scene analysis, and temporal reasoning.
Kenneth D. Forbus is Professor of Computer Science and Education at the Institute for Learning Sciences, Northwestern University. Johan de Kleer directs the Systems and Practices Laboratory at the Xerox Palo Alto Research Center.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Classical Problem Solving
PatternDirected Inference Systems
Extending PatternDirected Inference Systems
Introduction to Truth Maintenance Systems
JustificationBased Truth Maintenance Systems
Putting the JTMS to Work
LogicBased Truth Maintenance Systems
Putting an LTMS to Work
Improving the Completeness of Truth Maintenance Systems
Putting the ATMS to Work
Antecedent Constraint Languages
AssumptionBased Constraint Languages
A Tiny Diagnosis Engine
Symbolic Relaxation Systems
Implementing Qualitative Process Theory
AssumptionBased Truth Maintenance Systems
Other editions - View all
adder algorithm antecedents argument Artificial Intelligence assertions ATCON ATMS backtracking block C-S WATER LIQUID called cell Chapter choice sets clauses closed-world assumption Common Lisp computation conjunctive normal form consistent constraint network contains context contradiction handler created database datastructure datum debugging default defined dependency-directed search described diagnosis domain theory efficient encoding ensure environment equation example execution expression Figure FLUID-FLOW C-S WATER formula FTRE given global goal implementation inference engine input instance interface interpretation JSAINT JTMS JTRE justifications label LIQUID G literals logical LTMS LTRE macro match natural deduction nogood non-nil operator pattern variables phob possible prime implicates problem solver problem-solving procedure propagation provides QP theory qualitative queue reasoning relationships result retracted rule simple simplify solution solving statements strategy struct structure subproblems symbol TCON temporal database TGDE TGIZMO tion TMS node TMSs trigger truth maintenance systems