Truth Maintenance Systems for Problem Solving
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, an...
| Main Author: | |
|---|---|
| Language: | en_US |
| Published: |
2004
|
| Online Access: | http://hdl.handle.net/1721.1/6926 |
| _version_ | 1826211447613423616 |
|---|---|
| author | Doyle, Jon |
| author_facet | Doyle, Jon |
| author_sort | Doyle, Jon |
| collection | MIT |
| description | 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. |
| first_indexed | 2024-09-23T15:06:02Z |
| id | mit-1721.1/6926 |
| institution | Massachusetts Institute of Technology |
| language | en_US |
| last_indexed | 2024-09-23T15:06:02Z |
| publishDate | 2004 |
| record_format | dspace |
| spelling | mit-1721.1/69262019-04-10T14:25:47Z Truth Maintenance Systems for Problem Solving Doyle, Jon 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. 2004-10-20T20:07:59Z 2004-10-20T20:07:59Z 1978-01-01 AITR-419 http://hdl.handle.net/1721.1/6926 en_US AITR-419 12059635 bytes 9480337 bytes application/postscript application/pdf application/postscript application/pdf |
| spellingShingle | Doyle, Jon Truth Maintenance Systems for Problem Solving |
| title | Truth Maintenance Systems for Problem Solving |
| title_full | Truth Maintenance Systems for Problem Solving |
| title_fullStr | Truth Maintenance Systems for Problem Solving |
| title_full_unstemmed | Truth Maintenance Systems for Problem Solving |
| title_short | Truth Maintenance Systems for Problem Solving |
| title_sort | truth maintenance systems for problem solving |
| url | http://hdl.handle.net/1721.1/6926 |
| work_keys_str_mv | AT doylejon truthmaintenancesystemsforproblemsolving |