Skip to main content

A natural semantics for logic programs with negation

  • Logic Programming
  • Conference paper
  • First Online:
Foundations of Software Technology and Theoretical Computer Science (FSTTCS 1989)

Abstract

Two natural ways to specify the declarative semantics of logic programs and deductive databases are the fixpoint theory of Van Emden and Kowalski [11] and Clark's predicate completion [2]. The fixpoint theory does not apply to general programs with negation; a generalization of the theory can be defined [1,12] only if the programs are stratified. Clark's predicate completion is defined for logic programs with negation. In general, it fails to capture their intended semantics [7,8,9].

In this paper, we introduce a new notion of quasi-interpretation as a set of ground clauses of the form A ← ¬ B 1, ..., ← B n and extend the classic fixed point theory in [11] to quasi-interpretations. The semantics of a logic program P is defined by Clark's predicate completion of the least fixpoint of a continuous operator T P on quasi-interpretations. It is called the fixpoint completion of P, fixcomp(P). We then discuss the relations between fixcomp(P) and other approaches [5,7,8,9].

On leave from Institute of Computer Science and Cybernetics, National Center for Scientific Research of Vietnam, Lieugiai, Badinh, Hanoi, Vietnam.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. K. Apt, H. Blair and A. Walker. Towards a Theory of Declarative Knowledge, In J. Minker, editor, Foundation of Deductive Database and Logic Programming, pages 89–148. Morgan Kaufmann, 1988.

    Google Scholar 

  2. K. Clark. Negation as failure. In H. Gallaire and J. Minker, editors, Logic and Databases, pages 293–322. Plenum Press, 1978.

    Google Scholar 

  3. P. M. Dung and K. Kanchanasut. A Fixpoint Approach to Declarative Semantics of Logic Programs. In Proc of the North American Conference on Logic Programming, Cleveland, Ohio, 1989.

    Google Scholar 

  4. P.M. Dung and K. Kanchanasut. Constructive Semantics for Logic Programs. Technical Report, AIT-CS, 6/89, April 1989.

    Google Scholar 

  5. M. Gelford and V. Lifschitz. The stable model semantics for logic programs. In Proc of the Fifth International Conference on Logic Programming, pages 1070–1079. Seatles, Washington, 1988.

    Google Scholar 

  6. J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag, second edition 1987.

    Google Scholar 

  7. T. C. Przymusinski. On the declarative semantics of deductive database and logic programming. In J. Minker, editor, Foundation of Deductive Database and Logic Programming, pages 193–216. Morgan Kaufmann, 1988.

    Google Scholar 

  8. H. Przymusinska and T. C. Przymusinski. Weakly perfect model semantics for logic programs. In Proc of the Fifth International Conference in Logic Programming, pages 1106–1120. Seatles, Washington, 1988.

    Google Scholar 

  9. T. C. Przymusinski. Perfect model semantics. In Proc of the Fifth International Conference in Logic Programming, pages 1079–1096. Seatles, Washington, 1988.

    Google Scholar 

  10. T. C. Przymusinski. Non-Monotonic Formalisms and Logic Programming. In Proc of the Sixth International Conference in Logic Programming, pages 655–674. Lisbon, 1989.

    Google Scholar 

  11. M. van Emden and R. Kowalski. The semantics of logic as a programming language. Journal of the ACM 23: 733–742, 1976.

    Article  Google Scholar 

  12. A. van Gelder. Negation as failure using tight derivations for general logic programs. Journal of Logic Programming 6: 109–133, 1989.

    Article  Google Scholar 

  13. A. van Gelder, K. Ross and J.S. Schipf. Unfounded sets and well-founded semantics for general logic programs. In Proc. of the Seventh ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, page 221–230.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

C. E. Veni Madhavan

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dung, P.M., Kanchanasut, K. (1989). A natural semantics for logic programs with negation. In: Veni Madhavan, C.E. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1989. Lecture Notes in Computer Science, vol 405. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52048-1_34

Download citation

  • DOI: https://doi.org/10.1007/3-540-52048-1_34

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-52048-1

  • Online ISBN: 978-3-540-46872-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics