Abstract
We propose a new semantics for general logic programs which stems from first principles of logic-programming semantics. Our theory-unifies previous approaches and is applicable to some useful programs which are not properly handled by existing semantics.
Acknowledges the support of the National Science Foundation, NFWO
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Michael Gelfond and Vladimir Lifschitz. The stable model semantics for logic programming. In Robert A. Kowalski and Kenneth A. Bowen, editors, Proceedings of the Fifth International Conference and Symposium on Logic Programming, pages 1081–1086, Seattle, 1988. ALP, IEEE, The MIT Press.
A. Van Gelder, K. Ross, and J. S. Schlipf. Unfounded sets and well-founded semantics for general logic programs. In Proceedings of the Seventh ACM Symposium on Principles of Database Systems, pages 221–230, Austin, Texas, 1988. Association for Computing Machinery.
H. Jakobovits and D. Vermeir. Contradiction in argumentation frameworks. In Proceedings of the IPMU conference, 1996.
H. Jakobovits and D. Vermeir. Argumentation and logic-programming semantics. In preparation.
A.C. Kakas and P. Mancarella. Stable theories for logic programs. In Proceedings of the International Symposium of Logic Programming. 1991.
A. C. Kakas, P. Mancarella, and Phan Minh Dung. The acceptability semantics for logic programs. In P. Van Hentenrijck, editor, Proceedings of the 11th International Conference on Logic Programming, pages 504–519. MIT Press, 1994.
E. Laenens, D. Vermeir, and C. Zaniolo. Logic programming semantics made easy. In Proceedings of the International Conference on Automata, Languages and Programming, pages 499–508. 1992.
T. Przymusinski. Well-founded semantics coincides with three-valued stable semantics. Fundamenta Informaticae, 13:445–463, 1990.
D. Sacca and C. Zaniolo. Stable models and non-determinism for logic programs with negation. In Proceedings of the 9th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. Association for Computing Machinery, 1990.
A. Tarski. A lattice theoretical fixpoint theorem and its application. Pacific Journal of Mathematics, (5):285–309, 1955.
Jia-Huai You and Li Yan Yuan. Three-valued formalization of logic programming: Is it needed? In Proc. of the PODS'90 conference, pages 172–182. 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jakobovits, H., Vermeir, D. (1996). R-stable models for logic programs. In: Pedreschi, D., Zaniolo, C. (eds) Logic in Databases. LID 1996. Lecture Notes in Computer Science, vol 1154. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0031744
Download citation
DOI: https://doi.org/10.1007/BFb0031744
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61814-0
Online ISBN: 978-3-540-70683-0
eBook Packages: Springer Book Archive