Skip to main content
SpringerLink
Log in

Minimal Founded Semantics for Disjunctive Logic Programming

  • Conference paper
  • First Online:
Logic Programming and Nonmonotonic Reasoning (LPNMR 1999)

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

Abstract

In this paper, we propose a new semantics for disjunctive logic programming and deductive databases. The semantics, called minimal founded, generalizes stable model semantics for normal (i.e. non disjunctive) programs but differs from disjunctive stable model semantics (the extension of stable model semantics for disjunctive programs). Compared with disjunctive stable model semantics, the minimal founded semantics seems to be, in some case, more intuitive, it gives meaning to programs which are meaningless under stable model semantics and it is not harder to compute. We study the expressive power of the semantics and show that for general disjunctive datalog programs it has the same power of disjunctive stable model semantics. We also present a variation of the minimal founded semantics, called strongly founded which on stratified programs coincide with the perfect model semantics.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Abiteboul, S., Hull, R., Vianu, V. (1994), Foundations of Databases. Addison-Wesley.

    Google Scholar 

  2. S. Brass and J. Dix. Classifying semantics of disjunctive logic programs. Proc. JICSLP-92, pp. 798–812, 1993.

    Google Scholar 

  3. Cadoli M, T. Eiter and G. Gottlob, Default Logic as a Query Language, IEEE Transaction on Knowledge and Data Engineering, 9p(3), 1997, 448–463.

    Article  Google Scholar 

  4. Chandra, A., D. Harel. Structure and Complexity of Relational Queries. Journal of Computer and System Sciences, 25, pp. 99–128, 1982.

    Article  MATH  Google Scholar 

  5. T. Eiter and G. Gottlob. Complexity aspects of various semantics of disjunctive databases, Proc. Int. Conf. on Principles of Database Systems, 158–166, 1993.

    Google Scholar 

  6. T. Eiter, G. Gottlob and H. Mannila (1997), Disjunctive Datalog, ACM Transactions on Database Systems, 22(3):364–418, 1997

    Article  Google Scholar 

  7. T. Eiter and N. Leone and D. Saccá. Expressive Power and Complexity of Partial Models for Disjunctive Deductive databases, Theoretical Computer Science, 1997.

    Google Scholar 

  8. Eiter T., N. Leone, C. Mateis, G. Pfeifer and F. Scarcello. The KR System dlv: Progress Report, Comparisons and Benchmarks. Proc. of 6th Int. Conf. on Princ. of Knowledge Representation, 1998, pp. 406–417.

    Google Scholar 

  9. Fagin R. Generalized First-Order Spectra and Polynomial-Time Recognizable Sets, inComplexity of Computation, SIAM-AMS Proc., Vol. 7, pp. 43–73, 1974.

    MathSciNet  Google Scholar 

  10. Fernandez, J. A., and Minker, J. Computing perfect models of disjunctive stratified databases. In Proc. ILPS’91 Workshop on Disjunctive Logic Programming, pp.110–117, 1991.

    Google Scholar 

  11. Gelfond, M., Lifschitz, V. The Stable Model Semantics for Logic Programming, in Proc. of Fifth Conf. on Logic Programming, pp. 1070–1080, 1988.

    Google Scholar 

  12. Gelfond, M. and Lifschitz, V. (1991), Classical Negation in Logic Programs and Disjunctive Databases, New Generation Computing, 9, 365–385.

    Google Scholar 

  13. Greco, S., Binding Propagation in Disjunctive Databases, Proc. Int. Conf. on Very Large Data Bases, 1997.

    Google Scholar 

  14. Greco, S., Strongly founded semantics for disjunctive logic programming, Technical Report, 1999.

    Google Scholar 

  15. Leone, N., P. Rullo, P. and F. Scarcello. Disjunctive Stable Models: Unfounded Sets, Fixpoint Semantics and Computation, Information and Computation, Academic Press, Vol. 135, No. 2, June 15, pp. 69–112, 1997.

    Article  MATH  MathSciNet  Google Scholar 

  16. Marek, W., Truszczyński, M., Autoepistemic Logic, Journal of the ACM, 38, 3, pp. 518–619, 1991.

    Article  Google Scholar 

  17. Minker, J. On Indefinite Data Bases and the Closed World Assumption, in “Proc. of the 6th Conference on Automated Deduction (CADE-82),” pp. 292–308, 1982.

    Google Scholar 

  18. Przymusinski, T. On the Declarative Semantics of Deductive Databases and Logic Programming, in “Foundations of deductive databases and logic programming,” Minker, J. ed., ch. 5, pp.193–216, 1988.

    Google Scholar 

  19. Przymusinski, T. Stable Semantics for Disjunctive Programs, New Generation Computing, 9, 401–424, 1991.

    Article  Google Scholar 

  20. D. Saccá. The Expressive Powers of Stable Models for Bound and Unbound DA-TALOG Queries. Journal of Computer and System Sciences, Vol. 54, No. 3, June 1997, pp. 441–464.

    Article  MathSciNet  Google Scholar 

  21. Stockmeyer, L.J. The Polynomial-Time Hierarchy. Theoretical Computer Science, 3, pp. 1–22, 1977.

    Article  MATH  MathSciNet  Google Scholar 

  22. Vardi M.Y., “The Complexity of Relational Query Languages”, Proc. ACM Symp.on Theory of Computing, pp. 137–146, 1982.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. DEIS, Univ. della Calabria, 87030, Rende, Italy

    Sergio Greco

Authors
  1. Sergio Greco
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

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

    Michael Gelfond

  2. Institut für Informationssysteme 184/2, Technische Universität Wien, Favoritenstrβe 9-11, A-1040, Vienna, Austria

    Nicola Leone  & Gerald Pfeifer  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Greco, S. (1999). Minimal Founded Semantics for Disjunctive Logic Programming. In: Gelfond, M., Leone, N., Pfeifer, G. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 1999. Lecture Notes in Computer Science(), vol 1730. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46767-X_16

Download citation

  • DOI: https://doi.org/10.1007/3-540-46767-X_16

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66749-0

  • Online ISBN: 978-3-540-46767-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation