Abstract
In this paper, we present a (sound and complete) procedure for computing the maximal 3-valued stable models (preferred extensions) of propositional logic programs with negation as failure. This procedure uses the Assumption-based Truth Maintenance System (ATMS) data structures and mechanisms, and is grounded on the concept of acceptability of a (negative) hypothesis.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
A. Brogi, E. Lamma, and P. Mello. ATMS for Implementing Logic Programming. In B. Neumann, editor, Proceedings 10th European Conference on Artificial Intelligence, pages 114–118. John Wiley and Sons, 1992.
A. Brogi, E. Lamma, P. Mancarella, and P. Mello. Normal Logic Programs as Open Positive Programs. In Proceedings Joint International Conference and Symposium on Logic Programming JICSLP92, pages 783–797. Washington (USA), November 1992, The MIT Press.
A. Brogi, E. Lamina, P. Mancarella, and P. Mello. Semantics for Abductive Logic Programs. In Proceedings ICLP93 Workshop on Abductive Reasoning. Budapest (H), 24–25 June 1993.
J. de Kleer. An Assumption-based TMS. Artificial intelligence, 28: 127–162, 1986.
O. Dressler. Problem Solving with the NM-ATMS. In Y., editor, Proceedings 9th European Conference on Artificial Intelligence, pages 253–258. Pitman Publishing, 1988.
P. M. Dung. Negation as Hypothesis: An Abductive Foundation for Logic Programming. In K. Furukawa., editor. Proceedings 8th International Conference on Logic Programming. The MIT Press, 1991.
K. Eshghi and R.A. Kowalski. Abduction compared with negation by failure. In G. Levi and M. Martelli, editors, Proceedings 6th International Conference on Logic Programming, page 234–254. The MIT Press, 1989.
K. Eshghi. Computing Stable Models by Using the ATMS. In Proc. AAAI90, pages 272–277. AAAI, 1990.
M. Gelfond and V. Lifschitz. The Stable Models Semantics for Logic Programs. In R. A. Kowalski and K. A. Bowen, editors, Proc. Fifth International Conference on Logic Programming, pages 1070–1080. The MIT Press, 1988.
U. Junker. A Correct, Non-Monotonic ATMS. Proc. IJCAI89, Morgan Kaufman 1989.
A.C. Kakas and P. Mancarella. Generalized stable models: a semantics for abduction. In L. Carlucci Aiello, editor, Proceedings of 9th European Conference on Artificial Intelligence, pages 385–391. Pitman, 1990.
A.C. Kakas and P. Mancarella,. On the Relation between Truth Maintenance and Abduction. In Proc. PRICAI, 1991.
E. Lamma, and P. Mello. Computing 3-valued Stable Models by using the ATMS. DEIS Tecnical Report. University of Bologna (I), June 1993.
J.W. Lloyd. Foundations of logic programming. Springer-Verlag, second edition, 1987.
L.M. Pereira, J.N. Aparicio, J.J. Alferes. Derivation Procedures for Extended Stable Models. Proc. IJCAI91, pages 863–868. Morgan Kaufman 1991.
S.G. Pimentel. and J.L. Cuadrado. A Truth Maintenance System Based on Stable Models. In E.W. Lusk, and R.A. Overbeek, editors, Proc. NACLP89, pages 274–288. The MIT Press, 1989.
G.M. Provan. The Computational Complexity of Multiple-context Truth Maintenance Systems. In L. Carlucci Aiello, editor, Proceedings of 9th European Conference on Artificial Intelligence, pages 522–527. Pitman, 1990.
T.C. Przymusinski. Extended Stable Semantics for Normal and Disjunctive Programs. In D.H.D. Warren and P. Szeredi, editors, Proc. 7th International Conference on Logic Programming, page 459–477. The MIT Press, 1990.
W.L. Rodi and S.G. Pimentel. A Nonmonotonic Assumption-based TMS Using Stable Bases. In Proc. KR91. pages 485–495, 1991.
Saccà, D., and Zaniolo, C., “Stable models and non determinism in logic programs with negation”, In Proc. PODS'90, 1990.
K. Satoh, and N. Iwayama. Computing Abduction Using the TMS. in Proceedings 8th International Conference on Logic Programming ICLP91, pages 505–518. Paris (F). June 1991. The MIT Press.
K. Satoh, and N. Iwayama. A Query Evaluation Method for Abductive Logic Programming. Proceedings Joint International Conference and Symposium on Logic Programming JICSLP92, pages 671–685. Washington (USA), November 1992, The MIT Press.
A. Van Gelder, K.A. Ross, and J.S. Schlipf. The Well-Founded Semantics for General Logic Programs. In Journal of the ACM. Vol. 38, No. 3, pages 620–650. ACM, 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lamma, E., Mello, P. (1993). Computing 3-valued stable models by using the ATMS. In: Torasso, P. (eds) Advances in Artificial Intelligence. AI*IA 1993. Lecture Notes in Computer Science, vol 728. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57292-9_38
Download citation
DOI: https://doi.org/10.1007/3-540-57292-9_38
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57292-3
Online ISBN: 978-3-540-48038-9
eBook Packages: Springer Book Archive