Abstract
A truth maintenance system (TMS) is used to record justifications for assertions. Such justifications can be used to generate explanations and to track down the assumptions underlying assertions. In RUP <219> every justification is a disjunctive clause of sentential (propositional) atoms and any such clause can be treated as a justification. RUP’s TMS takes a set of such propositional clauses and performs propositional constraint propagation <39> to ensure that every assertion with a valid justification is in fact believed by the system (thus ensuring a deduction invariant). RUP’s TMS aiso ensures that there is an entry on a contradiction queue for every propositional clause all of whose atoms are false.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Doyle, J. Truth Maintenance Systems for Problem Solving. Technical Report 419. MIT Al Lab. September. 1978.
McAllester, D. An Outlook on Truth Maintenance. Technical Report 551. MIT AI Lab, August, 1980.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1984 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Bundy, A., Wallen, L. (1984). Truth Maintenance System. In: Bundy, A., Wallen, L. (eds) Catalogue of Artificial Intelligence Tools. Symbolic Computation. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-96868-6_250
Download citation
DOI: https://doi.org/10.1007/978-3-642-96868-6_250
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-13938-6
Online ISBN: 978-3-642-96868-6
eBook Packages: Springer Book Archive