Skip to main content
SpringerLink
Log in

On extended disjunctive logic programs

  • Invited Talk I
  • Conference paper
  • First Online:
Methodologies for Intelligent Systems (ISMIS 1993)

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

Included in the following conference series:

Abstract

This paper studies, in a comprehensive manner, different aspects of extended disjunctive logic programs, that is, programs whose clauses are of the form l 1 ∨ ... ∨ l k ← l k+1, ..., l m , not l m+1,..., not l n , where l 1,..., l n are literals (i.e. atoms and classically negated atoms), and not is the negation-by-default operator. The explicit use of classical negation suggests the introduction of a new truth value, namely, logical falsehood (in contrast to falsehood-by-default) in the semantics. General techniques are described for extending the model, fixpoint, and proof theories of an arbitrary semantics of normal disjunctive logic programs to cover the class of extended programs. Illustrations of these techniques are given for stable models, disjunctive well-founded and stationary semantics. Also, the declarative complexity of the extended programs as well as the algorithmic complexity of the proof procedures are discussed.

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. J.J. Alferes and L.M. Pereira. On logic program semantics with two kinds of negation. In K. Apt, editor, Proceedings of the Joint International Conference and Symposium on Logic Programming, pages 574–588, Washington, D.C. USA, Nov 1992. The MIT Press.

    Google Scholar 

  2. C. Baral. Issues in Knowledge Representation: Semantics and Knowledge Combination. PhD thesis, University of Maryland, College Park, MD. 20742 USA, 1991.

    Google Scholar 

  3. C. Baral, J. Lobo, and J. Minker. Generalized disjunctive well-founded semantics: Declarative semantics. In Proceedings of the Fifth International Symposium on Methodologies for Intelligent Systems, pages 465–473, Knoxville TN, USA, 1990.

    Google Scholar 

  4. C. Baral, J. Lobo, and J. Minker. Generalized disjunctive well-founded semantics: Procedural semantics. In Proceedings of the Fifth International Symposium on Methodologies for Intelligent Systems, pages 456–464, Knoxville TN, USA, 1990.

    Google Scholar 

  5. C. Baral, J. Lobo, and J. Minker. WF3: A semantics for negation in normal disjunctive logic programs. In Proceedings of the Sixth International Symposium on Methodologies for Intelligent Systems, pages 459–468, Charlotte NC, USA, 1991.

    Google Scholar 

  6. M. Cadoni and M. Schaerf. A survey on complexity results for non-monotonic logics. Preprint, Università di Roma “La Sapienza”, via Salaria 113, 00198 Roma, Italy, 1992.

    Google Scholar 

  7. K.L. Clark. Negation as failure. In H. Gallaire and J. Minker, editors, Logic and Data Bases, pages 293–322. Plenum, New York, USA, 1978.

    Google Scholar 

  8. J.A. Fernández and J. Lobo. A proof procedure for stable theories. Technical Report CS-TR-3034, UMIACS-TR-93-14, University of Maryland, College Park, MD 20742 USA, 1993.

    Google Scholar 

  9. J.A. Fernández, J. Lobo, J. Minker, and V.S. Subrahmanian. Disjunctive lp + integrity constrains = stable model semantics. Annals of Mathematics and Artificial Inteligence, 8(3–4), 1993.

    Google Scholar 

  10. M. Gelfond. On stratified autoepistemic theories. In Proceedings of AAAI-87, pages 207–211, 1987.

    Google Scholar 

  11. M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In R. Kowalski and K. Bowen, editors, Procedings of the Fifth International Conference and Symposium on Logic Programming, pages 1070–1080, Seattle, WA. USA, Aug. 1988. The MIT Press.

    Google Scholar 

  12. M. Gelfond and V. Lifschitz. Logic programs with classical negation. In D.H.D. Warren and P. Szeredi, editors, Proceedings of the Seventh International Conference on Logic Programming, pages 579–597, Jerusalem, Israel, June 1990. The MIT Press.

    Google Scholar 

  13. M. Gelfond and V. Lifschitz. Classical negation in logic programs and disjunctive databases. New Generation Computing, 9:365–385, 1991.

    Google Scholar 

  14. K. Inoue, M. Koshimura, and R. Hasegawa. Embedding negation as failure into a model generation theorem prover. In D. Kapur, editor, Proceedings of the Eleventh International Conference on Automated Deduction, pages 400–415, Saratoga Springs NY, USA, June 1992. Springer-Verlag.

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  17. V. W. Marek, A. Nerode, and J.B. Remmel. The stable models of a predicate logic program. In K. Apt, editor, Proceedings of the Joint International Conference and Symposium on Logic Programming, pages 446–460, Washington, USA, Nov 1992. The MIT Press.

    Google Scholar 

  18. V. W. Marek and Truszczyński. Autoepistemic logic. Journal of the ACM, 38(3):588–619, 1991.

    Google Scholar 

  19. V. W. Marek and Truszczyński. Computing intersection of autoepistemic expansions. In Proceedings of the Fifth International Workshop on Logic Programming and Non-monotonic Reasoning, pages 37–50. The MIT Press, 1991.

    Google Scholar 

  20. J. Minker. On indefinite databases and the closed world assumption. In Proceedings of the Sixth Conference on Automated Deduction, pages 292–308, 1982.

    Google Scholar 

  21. J. Minker and A. Rajasekar. A fixpoint semantics for disjunctive logic programs. Journal of Logic Programming, 9(1):45–74, July 1990.

    Google Scholar 

  22. P. Pearce and G. Wagner. Logic programming with strong negation. In P. Schroeder-Heister, editor, Proceedings of the International Workshop on Extensions of Logic Programming, pages 311–326, Tübingen, FRG, Dec. 1989. Lecture Notes in Artificial Intelligence, Springer-Verlag.

    Google Scholar 

  23. T. C. Przymusinski. Stable semantics for disjunctive programs. New Generation Computing, 9:401–424, 1991.

    Google Scholar 

  24. T.C. Przymusinski. Perfect model semantics. In R. Kowalski and K. Bowen, editors, Proceedings of the Fifth International Conference and Symposium on Logic Programming, pages 1081–1096, Seattle, WA. USA, Aug. 1988. The MIT Press.

    Google Scholar 

  25. T.C. Przymusinski. Extended stable semantics for normal and disjunctive programs. In D.H.D. Warren and P. Szeredi, editors, Proceedings of the Seventh International Conference on Logic Programming, pages 459–477, Jerusalem, Israel, June 1990. The MIT Press.

    Google Scholar 

  26. T.C. Przymusinski. Stationary semantics for disjunctive logic programs and deductive databases. In S. Debray and M. Hermenegildo, editors, Proceedings of the North American Conference on Logic Programming, pages 42–59, Austin, TX. USA, Oct. 1990. The MIT Press.

    Google Scholar 

  27. A. Rajasekar, J. Lobo, and J. Minker. Weak generalized closed world assumption. Automated Reasoning, 5:293–307, 1989.

    Google Scholar 

  28. R. Reiter. On closed world data bases. In H. Gallaire and J. Minker, editors, Logic and Data Bases, pages 55–76. Plenum, New York, 1978.

    Google Scholar 

  29. K.A. Ross and R.W. Topor. Inferring negative information from disjunctive databases. Journal of Automated Reasoning, 4(2):397–424, Dec. 1988.

    Google Scholar 

  30. J.S. Schlipf. A survey of complexity and undecidability results in logic programming. In H. Blair, V.W. Marek, A. Nerode, and J. Remmel, editors, Informal Proceedings of the Worshop on Structural Complexity and Recursion-theoretic Methods in Logic Programming., pages 143–164, Washington, D.C. USA, Nov. 1992.

    Google Scholar 

  31. M.H. van Emden and R.A. Kowalski. The semantics of predicate logic as a programming language. Journal of the ACM, 23(4):733–742, 1976.

    Google Scholar 

  32. A. van Gelder, K.A. 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, 1988.

    Google Scholar 

  33. A. Yahya and L.J. Henschen. Deduction in non-Horn databases. Journal of Automated Reasoning, 1(2):141–160, 1985.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Maryland, 20742, College Park, MD, USA

    Jack Minker & Carolina Ruiz

  2. Institute for Advanced Computer Studies, University of Maryland, 20742, College Park, MD, USA

    Jack Minker

Authors
  1. Jack Minker
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Carolina Ruiz
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jan Komorowski Zbigniew W. Raś

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Minker, J., Ruiz, C. (1993). On extended disjunctive logic programs. In: Komorowski, J., Raś, Z.W. (eds) Methodologies for Intelligent Systems. ISMIS 1993. Lecture Notes in Computer Science, vol 689. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56804-2_1

Download citation

  • DOI: https://doi.org/10.1007/3-540-56804-2_1

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56804-9

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation