Skip to main content
SpringerLink
Log in
Book cover

International Conference on Logic Programming

ICLP 2001: Logic Programming pp 212–226Cite as

Ultimate Well-Founded and Stable Semantics for Logic Programs with Aggregates

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2237))

Abstract

In this paper, we propose an extension of the well-founded and stable model semantics for logic programs with aggregates. Our approach uses Approximation Theory, a fixpoint theory of stable and well-founded fixpoints of non-monotone operators in a complete lattice. We define the syntax of logic programs with aggregates and define the immediate consequence operator of such programs. We investigate the well-founded and stable semantics generated by Approximation Theory. We show that our approach extends logic programs with stratified aggregation and that it correctly deals with well-known benchmark problems such as the shortest path program and the company control problem.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. P. Consens and A. O. Mendelzon. Low-complexity aggregation in GraphLog and Datalog. Theoretical Computer Science, 116(1):95–116, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  2. M. Denecker. The well-founded semantics is the principle of inductive definition. In J. Dix, L. F. del Cerro, and U. Furbach, editors, Logics in Artificial Intelligence, European Workshop, volume 1489 of Lecture Notes in Computer Science, pages 1–16, Dagstuhl, Germany, 1998. Springer.

    Chapter  Google Scholar 

  3. M. Denecker. Extending classical logic with inductive definitions. In J. Lloyd et al., editors, 1st International Conference on Computational Logic, volume 1861 of Lecture Notes in Artificial Intelligence, pages 703–717, London, U.K., July 2000. Springer.

    Google Scholar 

  4. M. Denecker, M. Bruynooghe, and V. W. Marek. Logic programming revisited: logic programs as inductive definitions. ACM Transactions on Computational Logic, 2001. accepted.

    Google Scholar 

  5. M. Denecker, V. Marek, and M. Truszczyński. Approximating operators, stable operators, well-founded fixpoints and applications in non-monotonic reasoning. In J. Minker, editor, Logic-based Artificial Intelligence, pages 127–144. Kluwer Academic Publishers, 2000.

    Google Scholar 

  6. M. Denecker, V. Marek, and M. Truszczyński. Ultimate approximations. Report CW 320, Department of Computer Science, K.U.Leuven, Belgium, Sept. 2001.

    Google Scholar 

  7. M. Denecker, V. W. Marek, and M. Truszczynski. Uniform semantic treatment of default and autoepistemic logics. In A. Cohn, F. Giunchiglia, and B. Selman, editors, Proceedings of the 7th International Conference on Principles of Knowledge Representation and Reasoning, pages 74–84, 2000.

    Google Scholar 

  8. J. Dix and M. Osorio. On well-behaved semantics suitable for aggregation. Technical ReportTR 11/97, University of Koblenz, Department of Computer Science, Rheinau 1, Apr. 1997. Accepted at ILPS’ 97 as poster paper.

    Google Scholar 

  9. M. Fitting. Bilattices and the semantics of logic programming. The Journal of Logic Programming, 11(1,2):91–116, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  10. M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In R. A. Kowalski and K. A. Bowen, editors, Logic Programming, Proceedings of the 5th International Conference and Symposium, pages 1070–1080, Seattle, Washington, 1988. MIT Press.

    Google Scholar 

  11. A. C. Kakas, R. Kowalski, and F. Toni. Abductive logic programming. Journal of Logic and Computation, 2(6):719–770, Dec. 1992.

    Article  MATH  MathSciNet  Google Scholar 

  12. D. B. Kemp and P. J. Stuckey. Semantics of logic programs with aggregates. In V. A. Saraswat and K. Ueda, editors, Proceedings of the International Logic Programming Symposium, pages 387–401. MIT Press, 1991.

    Google Scholar 

  13. V. W. Marek and M. Truszczyński. Stable models and an alternative logic programming paradigm. In K. R. Apt, V. W. Marek, M. Truszczyński, and D. S. Warren, editors, The Logic Programming Paradigm: A 25-Year Perespective, pages 375–398. Springer, 1999.

    Google Scholar 

  14. I. S. Mumick, H. Pirahesh, and R. Ramakrishnan. The magic of duplicates and aggregates. In D. McLeod, R. Sacks-Davis, and H.-J. Schek, editors, 16th International Conference on Very Large Data Bases, pages 264–277. Morgan Kaufmann, 1990.

    Google Scholar 

  15. I. Niemelä. Logic programs with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence, 25(3,4):241–273, 1999.

    Article  MATH  MathSciNet  Google Scholar 

  16. I. Niemelä, P. Simons, and T. Soininen. Stable model semantics of weight constraint rules. In M. Gelfond, N. Leone, and G. Pfeifer, editors, Proceedings of the Fifth International Conference on Logic Programming and Nonmonotonic Reasoning, volume 1730 of Lecture Nortes in Computer Science, pages 317–331. Springer-Verlag, 1999.

    Google Scholar 

  17. K. A. Ross and Y. Sagiv. Monotonic aggregation in deductive databases. Journal of Computer and System Sciences, 54(1):79–97, 1997.

    Article  MATH  MathSciNet  Google Scholar 

  18. S. Sudarshan, D. Srivastava, R. Ramakrishnan, and C. Beeri. Extending the wellfounded and valid semantics for aggregation. In D. Miller, editor, Proceedings of the International Logic Programming Symposium, pages 590–608. MIT Press, 1993.

    Google Scholar 

  19. A. Van Gelder. The well-founded semantics of aggregation. In Proceedings of the Eleventh ACM Symposium on Principles of Database Systems, pages 127–138. ACM Press, 1992.

    Google Scholar 

  20. A. Van Gelder. Foundations of aggregation in deductive databases. In S. Ceri, K. Tanaka, and S. Tsur, editors, Third International Conference on Deductive and Object-Oriented Databases, volume 760of Lecture Notes in Computer Science, pages 13–34. Springer-Verlag, 1993.

    Google Scholar 

  21. A. Van Gelder, K. A. Ross, and J. S. Schlipf. The well-founded semantics for general logic programs. Journal of the ACM, 38(3):620–650, 1991.

    Article  MATH  Google Scholar 

  22. B. Van Nuffelen and M. Denecker. Problem solving in ID-logic with aggregates: some experiments. In A. K. Mark Denecker, editor, Eight International Workshop on Nonmonotonic Reasoning, special track on Abductive Reasoning, Breckenridge, Colorado, USA, 2000.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, K.U.Leuven, Celestijnenlaan 200A, B-3001, Heverlee, Belgium

    Marc Denecker, Nikolay Pelov & Maurice Bruynooghe

Authors
  1. Marc Denecker
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nikolay Pelov
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Maurice Bruynooghe
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. LIP6, case 169, University of Paris 6, 8 rue du Capitaine Scott, 75015, Paris, France

    Philippe Codognet

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Denecker, M., Pelov, N., Bruynooghe, M. (2001). Ultimate Well-Founded and Stable Semantics for Logic Programs with Aggregates. In: Codognet, P. (eds) Logic Programming. ICLP 2001. Lecture Notes in Computer Science, vol 2237. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45635-X_22

Download citation

  • DOI: https://doi.org/10.1007/3-540-45635-X_22

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42935-7

  • Online ISBN: 978-3-540-45635-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation