Skip to main content
Log in

A fixpoint semantics for stratified databases

  • Regular Papers
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

Przymusinski extended the notion of stratified logic programs, developed by Apt, Blair and Walker, and by van Gelder, to stratified databases that allow both negative premises and disjunctive consequents. However, he did not provide a fixpoint theory for such class of databases. On the other hand, although a fixpoint semantics has been developed by Minker and Rajasekar for non-Horn logic programs, it is tantamount to traditional minimal model semantics which is not sufficient to capture the intended meaning of negation in the premises of clauses in stratified databases. In this paper, a fixpoint approach to stratified databases is developed, which corresponds with the perfect model semantics. Moreover, algorithms are proposed for computing the set of perfect models of a stratified database.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. van Emden, M. H. and Kowalski, R. A., The semantics of predicate logic as a programming language.JACM, 1976, 23, 733–742.

    Article  MATH  Google Scholar 

  2. Apt, K. R. and Emden, M. H., Contributions to the theory of logic programming,JACM, 1982, 29, 841–862.

    Article  MATH  Google Scholar 

  3. Apt, K. R., Blair, H. A., and Walker, A., Towards a theory of declarative knowledge. In.Foundations of deductive databases and logic programming (J. Minker, Ed.), Morgan Kaufmann Publishers, Los Altos, CA, 1988, 89–148.

    Google Scholar 

  4. van Gelder, A., Negation as failure using tight derivations for general logic programs. InFoundations of deductive databases and logic programming (J. Minker, Ed.), Morgan Kaufmann Publishers, Los Altos, CA, 1988, 149–176.

    Google Scholar 

  5. Przymusinski, T., On the declarative semantics of deductive databases and logic programs. InFoundations of deductive databases and logic programming (J. Minker, Ed.), Morgan Kaufmann Publishers, Los Altos, CA, 1988, 193–216.

    Google Scholar 

  6. Minker, J. and Rajasekar, A., A fixpoint semantics for non-Horn logic programming. Technique report, UMIACS-TR-87-24, University of Maryland, 1987.

  7. Lioyd, J. W., Foundations of logic programming. Springer, 1984.

  8. Minker, J., On indefinite databases and the closed world assumption. Lecture notes in computer science 138, Springer, 1982, 292–308.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yidong, S. A fixpoint semantics for stratified databases. J. of Compt. Sci. & Technol. 8, 108–117 (1993). https://doi.org/10.1007/BF02939473

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02939473

Keywords

Navigation