Abstract
A Justification -based Truth Maintenance System (JTMS) is classically represented by a network of nodes together with a set of links (justifications) that represent dependencies between nodes. In this representation, the relations between the justifications are not explicit. We propose a dual representation of a JTMS based on the dependencies between justifications. This representation allows us to separate the monotonic and non-monotonic parts of the network of dependencies. Based on this representation, we develop an incremental backtracking algorithm to compute an admissible labeling of a JTMS. This algorithm allows us to go from an admissible labeling to another, and so it always finds an admissible labeling when one exists, and dependency-directed backtracking must be called uniquely when all the admissible labelings are inconsistent.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Besnard, P., An Introduction to Default Logic, Springer-Verlag 1989.
Doyle, J., A Truth Maintenance System, Artificial Intelligence 12, 1979.
Elkan, C., A rational reconstruction of nonmonotonic Truth Maintenance Systems. Artificial Intelligence V.43, Number 2, 1990.
Goodwin, J. W., A Theory and System for Non-monotonic Reasoning. Dissertation 1987.
Junker, U., Konolige, K., Computing the extensions of Autoepistemic and Default Logics with a Truth Maintenance System, Proc. AAAI 90.
Junker, U., Variations of backtracking for TMS, Proc. Workshop, ECAI 90.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Quoc Dung, T. (1995). A new representation of JTMS. In: Pinto-Ferreira, C., Mamede, N.J. (eds) Progress in Artificial Intelligence. EPIA 1995. Lecture Notes in Computer Science, vol 990. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60428-6_5
Download citation
DOI: https://doi.org/10.1007/3-540-60428-6_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60428-0
Online ISBN: 978-3-540-45595-0
eBook Packages: Springer Book Archive