Abstract
By viewing a default rule t 1 ... t n; U s 1 ... U s m/t as a monotonic ATMS justification with assumptions Us i, we are able to prove a 1–1 correspondence between the admissible extensions (well-founded labellings) of a Doyle-like TMS and certain extensions of the associated ATMS.
To obtain this result, we modelled the TMS as a non-monotonic reasoning system according to Reiter and the ATMS as a (classical) monotonic reasoning system. The result is therefore interesting in the more general context of non-monotonic reasoning as well.
Preview
Unable to display preview. Download preview PDF.
References
Johan de Kleer. An Assumption Based TMS. Artifical Intelligence, 28:127–162, 1986
Johan de Kleer. Extending the ATMS. Artificial Intelligence, 28:163–196, 1986
Johan de Kleer. Problem solving with the ATMS. Artificial Intelligence, 28:197–224, 1986
Jon Doyle. A Truth Maintenance System. Artificial Intelligence, 12:231–272, 1979
Oskar Dressler. Extending the Basic ATMS. ECAI'88
Ulrich Junker. Einige Bemerkungen zu O.Dressler, Non-Monotonic Justifications for the Basic ATMS. GMD, F3-HIS
Michael Reinfrank. An Introduction to Non-Monotonic Reasoning. Technical Report MEMO-SEKI-85-02, Universität Kaiserslautern, June 1985
R. Reiter. A Logic for Default Reasoning. ARTIFICIAL INTELLIGENCE 13
R. Reiter and J de Kleer. Foundations of Assumption-Based Truth Maintenance. Proceedings AAAI-87, pp. 183–188
Frank Zetzsche. Einige Ergebnisse zur formalen Begründung des ATMS. TEX-B Memo 43–88
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zetzsche, F. (1989). Non-monotonic reasoning with the ATMS. In: Martins, J.P., Morgado, E.M. (eds) EPIA 89. EPIA 1989. Lecture Notes in Computer Science, vol 390. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51665-4_79
Download citation
DOI: https://doi.org/10.1007/3-540-51665-4_79
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51665-1
Online ISBN: 978-3-540-46743-4
eBook Packages: Springer Book Archive