Abstract:
General purpose truth maintenance systems have received considerable attention in the past few years. This paper discusses the functionality of truth maintenance systems and compares various existing algorithms. Applications and directions for future research are also discussed. Introduction In 1978 Jon Doyle wrote a masters thesis at the MIT AI Laboratory entitled "Truth Maintenance Systems for Problem Solving" [ Doyle, 1979 ] . In this thesis Doyle described an independent module called a truth maintenance system, or TMS, which maintained beliefs for general problem solving systems. In the twelve years since the appearance of Doyle's TMS a large body of literature has accumulated on truth maintenance. The seminal idea appears not to have been any particular technical mechanism but rather the general concept of an independent module for truth (or belief) maintenance. All truth maintenance systems manipulate proposition symbols and relationships between proposition symbols. I will use...
Citations
|
4701
|
Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference
– Pearl
- 1988
|
|
1122
|
The Stable Model Semantics for Logic Programming
– GELFOND, LIFSCHITZ
- 1988
|
|
862
|
Consistency in Networks of Relations
– Mackworth
- 1977
|
|
538
|
A truth maintenance system
– Doyle
- 1979
|
|
520
|
Diagnosing multiple faults
– Kleer, Williams
- 1987
|
|
411
|
Applications of circumscription to formalizing commonsense reasoning
– McCarthy
|
|
379
|
Increasing tree-search efficiency for constraint satisfaction problems
– Haralick, Elliot
- 1980
|
|
364
|
An assumption-based tms
– Kleer
- 1986
|
|
341
|
Network-based heuristics for constraint satisfaction problems
– Dechter, Pearl
- 1987
|
|
260
|
Foundations of assumption-based truth maintenancesystems: Preliminary report
– Reiter, Kleer
- 1987
|
|
175
|
Arc and path consistency revisited
– Mohr, Henderson
- 1986
|
|
150
|
A basis for a mathematical theory of computation
– McCarthy
- 1963
|
|
148
|
Performance measurement and analysis of certain search algorithms
– Gaschnig
- 1979
|
|
147
|
The Mathematics of Inheritance Systems
– Touretzky
- 1986
|
|
146
|
Diagnosis with behavioral modes
– Kleer, Williams
- 1989
|
|
125
|
A su cient condition for backtrack-bounded search
– Freuder
- 1985
|
|
62
|
Estimating the efficiency of backtrack programs
– Knuth
- 1975
|
|
53
|
Problem solving with the ATMS
– Kleer
- 1986
|
|
52
|
Extending the ATMS
– Kleer
- 1986
|
|
45
|
Automated recognition of tractability in inference relations
– McAllester
- 1993
|
|
43
|
Deduction revision by intelligent backtracking
– Bruynooghe, Pereira
- 1984
|
|
35
|
ONTIC: A Knowledge Representation System for Mathematics
– McAllester
- 1989
|
|
34
|
Taxonomic syntax for first order inference
– McAllester, Givan
- 1993
|
|
32
|
Forward reasoning and dependency directed backtracking in a system for computer aided circuit analysis
– Stallman, Sussman
- 1977
|
|
31
|
Autoepistemic logic and formalization of commonsense reasoning, preliminary report
– Gelfond
- 1988
|
|
19
|
Choices without backtracking
– Kleer
- 1984
|
|
16
|
Contexts and data dependencies: a synthesis
– McDermott
- 1983
|
|
15
|
Natural language syntax and first order inference
– McAllester, Givan
- 1992
|
|
12
|
Some applications of graph bandwidth to constraint satisfaction problems
– Zabih
- 1990
|
|
3
|
A practical clause management system
– Kleer
|
|
2
|
A comparison of ATMS and CSP
– Kleer
- 1989
|
|
2
|
On the relationship between default theories and autoepistemic logic
– Konolige
- 1987
|
|
1
|
Exploiting locality
– Kleer
- 1990
|
