Abstract
Current algorithms for Dependency-Directed Backtracking (DDB) suffer from several limitations. The added justifications produced by Doyle's DDB are sufficient but are neither safe nor complete. Petrie's DDB solves this problem, but it can lead to cases where odd loops are introduced later into JTMS network by new justifications, and so can sometimes miss legitimate admissible labelings. Moreover, Petrie's DDB cannot resolve an inconsistency if all possible added justifications produce an odd loop, although a solution may exist. We propose a revised method based on elective sets and premise sets of contradiction foundations that allows to use the premises as added justifications. Our revised DDB allows to resolve more inconsistencies than Petrie's DDB. Moreover, a preference ordering over the assumption justifications can be integrated; this order gives the problem solver some control over the choice of electives.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Doyle, J., A Truth Maintenance System, Artificial Intelligence 12, pp. 259–279, 1979.
Doyle, J., The Ins and Outs of Reason Maintenance, Proc. IJCAI 83, Karlsruhe Germany, pp. 349–351, 1983.
Dung, T. Q., A Revision of Dependency-Directed Backtracking for JTMS, Technical Report, IRIDIA-ULB (Belgium), 1995.
Petrie, C. J., Revised Dependency-Directed Backtracking for default reasoning, Proc. AAAI 87, Seattle, Washington, pp. 167–172, 1987.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dung, T.Q. (1996). A revision of Dependency-Directed Backtracking for JTMS. In: Görz, G., Hölldobler, S. (eds) KI-96: Advances in Artificial Intelligence. KI 1996. Lecture Notes in Computer Science, vol 1137. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61708-6_46
Download citation
DOI: https://doi.org/10.1007/3-540-61708-6_46
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61708-2
Online ISBN: 978-3-540-70669-4
eBook Packages: Springer Book Archive