Skip to main content

Towards a Systematic Account of Different Logic Programming Semantics

  • Conference paper
KI 2003: Advances in Artificial Intelligence (KI 2003)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2821))

Included in the following conference series:

Abstract

In [1,2] a new methodology has been proposed which allows to derive uniform characterizations of different declarative semantics for logic programs with negation. One result from this work is that the well-founded semantics can formally be understood as a stratified version of the Fitting (or Kripke-Kleene) semantics. The constructions leading to this result, however, show a certain asymmetry which is not readily understood. We will study this situation here with the result that we will obtain a coherent picture of relations between different semantics.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Hitzler, P., Wendt, M.: The well-founded semantics is a stratified Fitting semantics. In: Jarke, M., Koehler, J., Lakemeyer, G. (eds.) KI 2002. LNCS (LNAI), vol. 2479, pp. 205–221. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  2. Hitzler, P., Wendt, M.: A uniform approach to logic rogramming semantics. Technical Report WV–02–14, Knowledge Representation and Reasoning Group, Artificial Intelligence Institute, Department of Computer Science, Dresden University of Technology, Dresden, Germany (2002) (submitted)

    Google Scholar 

  3. Reiter, R.: A logic for default reasoning. Artificial Intelligence 13, 81–132 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  4. Lloyd, J.W.: Foundations of Logic Programming. Springer, Berlin (1988)

    Google Scholar 

  5. Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Kowalski, R.A., Bowen, K.A. (eds.) Logic Programming, Proceedings of the 5th International Conference and Symposium on Logic Programming, pp. 1070–1080. MIT Press, Cambridge (1988)

    Google Scholar 

  6. van Gelder, A., Ross, K.A., Schlipf, J.S.: The well-founded semantics for general logic programs. Journal of the ACM 38, 620–650 (1991)

    MATH  Google Scholar 

  7. Fitting, M.: A Kripke-Kleene-semantics for general logic programs. The Journal of Logic Programming 2, 295–312 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  8. Apt, K.R., Blair, H.A., Walker, A.: Towards a theory of declarative knowledge. In: Minker, J. (ed.) Foundations of Deductive Databases and Logic Programming, pp. 89–148. Morgan Kaufmann, Los Altos (1988)

    Google Scholar 

  9. Przymusinski, T.C.: On the declarative semantics of deductive databases and logic programs. In: Minker, J. (ed.) Foundations of Deductive Databases and Logic Programming, pp. 193–216. Morgan Kaufmann, Los Altos (1988)

    Google Scholar 

  10. Fitting, M.: Fixpoint semantics for logic programming — A survey. Theoretical Computer Science 278, 25–51 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  11. Denecker, M., Marek, V.W., Truszczynski, M.: Approximating operators, stable operators, well-founded fixpoints and applications in non-monotonic reasoning. In: Minker, J. (ed.) Logic-based Artificial Intelligence, pp. 127–144. Kluwer Academic Publishers, Boston (2000)

    Google Scholar 

  12. Przymusinski, T.C.: Well-founded semantics coincides with three-valued stable semantics. Fundamenta Informaticae 13, 445–464 (1989)

    MathSciNet  Google Scholar 

  13. van Gelder, A.: The alternating fixpoint of logic programs with negation. In: Proceedings of the Eighth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, Philadelphia, Pennsylvania, pp. 1–10. ACM Press, New York (1989)

    Chapter  Google Scholar 

  14. Dung, P.M., Kanchanasut, K.: A fixpoint approach to declarative semantics of logic programs. In: Lusk, E.L., Overbeek, R.A. (eds.) Logic Programming, Proceedings of the North American Conference 1989, NACLP 1989, Cleveland, Ohio, pp. 604–625. MIT Press, Cambridge (1989)

    Google Scholar 

  15. Fages, F.: Consistency of Clark’s completion and existence of stable models. Journal of Methods of Logic in Computer Science 1, 51–60 (1994)

    Google Scholar 

  16. Wendt, M.: Unfolding the well-founded semantics. Journal of Electrical Engineering, Slovak Academy of Sciences 53, 56–59 (2002); Proceedings of the 4th Slovakian Student Conference in Applied Mathematics, Bratislava (April 2002)

    MATH  Google Scholar 

  17. Hitzler, P.: Circular belief in logic programming semantics. Technical Report WV– 02–13, Knowledge Representation and Reasoning Group, Artificial Intelligence Institute, Department of Computer Science, Dresden University of Technology, Dresden, Germany (2002)

    Google Scholar 

  18. Jachymski, J.: Order-theoretic aspects of metric fixed-point theory. In: Kirk, W.A., Sims, B. (eds.) Handbook of Metric Fixed Point Theory, pp. 613–641. Kluwer Academic Publishers, Dordrecht (2001)

    Google Scholar 

  19. Fitting, M.: Bilattices and the semantics of logic programming. The Journal of Logic Programming 11, 91–116 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  20. Abramsky, S., Jung, A.: Domain theory. In: Abramsky, S., Gabbay, D., Maibaum, T.S. (eds.) Handbook of Logic in Computer Science, vol. 3. Clarendon, Oxford (1994)

    Google Scholar 

  21. Przymusinska, H., Przymusinski, T.C.: Weakly stratified logic programs. Fundamenta Informaticae 13, 51–65 (1990)

    MATH  MathSciNet  Google Scholar 

  22. Wang, K.: A comparative study of well-founded semantics for disjunctive logic programs. In: Eiter, T., Faber, W., Truszczyński, M. (eds.) LPNMR 2001. LNCS (LNAI), vol. 2173, pp. 133–146. Springer, Heidelberg (2001)

    Google Scholar 

  23. Mateis, C.: Quantitative disjunctive logic programming: Semantics and computation. AI communications 13, 225–248 (2000)

    MATH  MathSciNet  Google Scholar 

  24. Leite, J.A.: Evolving Knowledge Bases. Frontiers of Artificial Intelligence and Applications, vol. 81. IOS Press, Amsterdam (2003)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hitzler, P. (2003). Towards a Systematic Account of Different Logic Programming Semantics. In: Günter, A., Kruse, R., Neumann, B. (eds) KI 2003: Advances in Artificial Intelligence. KI 2003. Lecture Notes in Computer Science(), vol 2821. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39451-8_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-39451-8_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20059-8

  • Online ISBN: 978-3-540-39451-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics