R-stable models for logic programs

  • H. Jakobovits
  • D. Vermeir
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1154)


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.


logic programming semantics 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    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.Google Scholar
  2. 2.
    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.Google Scholar
  3. 3.
    H. Jakobovits and D. Vermeir. Contradiction in argumentation frameworks. In Proceedings of the IPMU conference, 1996.Google Scholar
  4. 4.
    H. Jakobovits and D. Vermeir. Argumentation and logic-programming semantics. In preparation.Google Scholar
  5. 5.
    A.C. Kakas and P. Mancarella. Stable theories for logic programs. In Proceedings of the International Symposium of Logic Programming. 1991.Google Scholar
  6. 6.
    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.Google Scholar
  7. 7.
    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.Google Scholar
  8. 8.
    T. Przymusinski. Well-founded semantics coincides with three-valued stable semantics. Fundamenta Informaticae, 13:445–463, 1990.Google Scholar
  9. 9.
    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.Google Scholar
  10. 10.
    A. Tarski. A lattice theoretical fixpoint theorem and its application. Pacific Journal of Mathematics, (5):285–309, 1955.Google Scholar
  11. 11.
    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.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • H. Jakobovits
    • 1
  • D. Vermeir
    • 1
  1. 1.Dept. of Computer ScienceFree University of Brussels, VUBBrusselsBelgium

Personalised recommendations