Skip to main content
SpringerLink
Log in

Generalized negation as failure and semantics of normal disjunctive logic programs

  • Session 11: Semantics II
  • Conference paper
  • First Online:
Logic Programming and Automated Reasoning (LPAR 1992)

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

Abstract

We introduce the concept of generalized negation as failure (GNAF) to infer the falsity of a conjunction of atoms when the individual atoms can not be inferred to be false. Using GNAF, we present disjunctive well-founded semantics (DWFS), an extension of well-founded semantics, to the class of normal disjunctive logic programs. We also use an extension of Rajasekar and Minker's fixpoint operator for disjunctive logic programs [10] to be able to infer the truth of disjunctions of literals. Our semantics is equivalent to well-founded semantics for normal logic programs. For disjunctive programs (i.e. without negation in their bodies) it gives a fixpoint characterization of Minker's GCWA [9]. It differs from the Generalized Disjunctive Well-Founded semantics by Baral et al. [2] and well-founded semantics for normal disjunctive logic programs given by Ross [14].

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. C Baral, J. Lobo, and J. Minker. WF 3: A Semantics for Negation in Normal Disjunctive Logic Programs with Equivalent Proof Methods. In Proceedings of ISMIS 1991.

    Google Scholar 

  2. C. Baral, J. Lobo, and J. Minker. Generalized disjunctive well-founded semantics for logic programs. Technical Report UMIACS TR 90-39, CS TR 2436, Dept of Computer Science, University of Maryland, College Park Md 20742, March 1989. To appear in Annals of Math and AI.

    Google Scholar 

  3. N. Belegrinos. Clausal, Partial Interpretations and the Closed World Assumption. Technical report, Dept of Computer Science, University of Melbourne, 1988.

    Google Scholar 

  4. M. Fitting and M. Ben-Jacob. Stratified and Three-Valued Logic programming Semantics. In R.A. Kowalski and K.A. Bowen, editors, Proc. 5 th International Conference and Symposium on Logic Programming, pages 1054–1069, Seattle, Washington, August 15–19, 1988.

    Google Scholar 

  5. A. van Gelder, K. Ross, and J. Schlipf. Unfounded Sets and Well-founded Semantics for General Logic Programs. In Proc. 7 th Symposium on Principles of Database Systems, pages 221–230, 1988.

    Google Scholar 

  6. A. van Gelder, K. Ross, and J. Schlipf. The Well-founded Semantics for General Logic Programs. In JA CM, Vol. 38, No. 3, July 1991, pages 620–650.

    Google Scholar 

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

    Google Scholar 

  8. J. Lobo, J. Minker and A. Rajasekar. Foundations of Disjunctive Logic Programming. MIT Press, 1992.

    Google Scholar 

  9. J. Minker. On Indefinite Databases and the Closed World Assumption. In Lecture Notes in Computer Science 138, pages 292–308. Springer-Verlag, 1982.

    Google Scholar 

  10. J. Minker and A. Rajasekar. A Fixpoint Semantics for Disjunctive Logic Programs, 1990. Journal of Logic Programming, 9(1):45–74, July 1990.

    Article  Google Scholar 

  11. T.C. Przymusinski. Every Logic Program has a Natural Stratification and an Iterated Fixed Point Model. In ”Proceedings of the 8th ACM SIGACT-SIGMOD-SIGART Symposium on Principle of Database Systems”, pages 11–21, 1989.

    Google Scholar 

  12. T. Przymusinski. Stationary semantics for disjunctive logic programs and deductive databases. In North American Conference on Logic Programming, pages 40–62, 1990.

    Google Scholar 

  13. T. Przymusinski. A semantics for disjunctive logic programs. Presented at the Workshop on Disjunctive Logic Programming in the International Logic Programming Symposium, Nov 1, 1991,San Diego.

    Google Scholar 

  14. K. Ross. The well-founded semantics for disjunctive logic programs. In Proc. of the First International Conference on Deductive and Object-oriented databases, pages 352–369, Kyoto, Japan, 1989.

    Google Scholar 

  15. C. Sakama. Possible model semantics for disjunctive databases II. Presented in the 1990 NACLP Workshop on Nonmonotonic Reasoning and Logic Programming, Austin, TX.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Texas at El Paso, 79968, El Paso, Texas, USA

    Chitta Baral

Authors
  1. Chitta Baral
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Andrei Voronkov

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Baral, C. (1992). Generalized negation as failure and semantics of normal disjunctive logic programs. In: Voronkov, A. (eds) Logic Programming and Automated Reasoning. LPAR 1992. Lecture Notes in Computer Science, vol 624. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0013071

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55727-2

  • Online ISBN: 978-3-540-47279-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation