Truth Maintenance Systems for Problem Solving

Title: en_US Truth Maintenance Systems for Problem Solving
Creator: en_US Doyle, Jon
Date: 2004-10-20T20:07:59Z
Date Available: 2004-10-20T20:07:59Z
Date Issued: en_US 1978-01-01
Identifier: en_US AITR-419
uri: http://hdl.handle.net/1721.1/6926
Abstract: en_US The thesis developed here is that reasoning programs which take care to record the logical justifications for program beliefs can apply several powerful, but simple, domain-independent algorithms to (1) maintain the consistency of program beliefs, (2) realize substantial search efficiencies, and (3) automatically summarize explanations of program beliefs. These algorithms are the recorded justifications to maintain the consistency and well founded basis of the set of beliefs. The set of beliefs can be efficiently updated in an incremental manner when hypotheses are retracted and when new information is discovered. The recorded justifications also enable the pinpointing of exactly whose assumptions which support any particular belief. The ability to pinpoint the underlying assumptions is the basis for an extremely powerful domain-independent backtracking method. This method, called Dependency-Directed Backtracking, offers vastly improved performance over traditional backtracking algorithms.
Extent: 12059635 bytes; 9480337 bytes
Format: application/postscript; application/pdf
Language: en_US
Relation: en_US AITR-419