Ultimate WellFounded and Stable Semantics for Logic Programs with Aggregates
 Marc Denecker,
 Nikolay Pelov,
 Maurice Bruynooghe
 … show all 3 hide
Abstract
In this paper, we propose an extension of the wellfounded and stable model semantics for logic programs with aggregates. Our approach uses Approximation Theory, a fixpoint theory of stable and wellfounded fixpoints of nonmonotone 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 wellfounded and stable semantics generated by Approximation Theory. We show that our approach extends logic programs with stratified aggregation and that it correctly deals with wellknown benchmark problems such as the shortest path program and the company control problem.
 M. P. Consens and A. O. Mendelzon. Lowcomplexity aggregation in GraphLog and Datalog. Theoretical Computer Science, 116(1):95–116, 1993. CrossRef
 M. Denecker. The wellfounded 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. CrossRef
 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.
 M. Denecker, M. Bruynooghe, and V. W. Marek. Logic programming revisited: logic programs as inductive definitions. ACM Transactions on Computational Logic, 2001. accepted.
 M. Denecker, V. Marek, and M. Truszczyński. Approximating operators, stable operators, wellfounded fixpoints and applications in nonmonotonic reasoning. In J. Minker, editor, Logicbased Artificial Intelligence, pages 127–144. Kluwer Academic Publishers, 2000.
 M. Denecker, V. Marek, and M. Truszczyński. Ultimate approximations. Report CW 320, Department of Computer Science, K.U.Leuven, Belgium, Sept. 2001.
 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.
 J. Dix and M. Osorio. On wellbehaved 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.
 M. Fitting. Bilattices and the semantics of logic programming. The Journal of Logic Programming, 11(1,2):91–116, 1991. CrossRef
 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.
 A. C. Kakas, R. Kowalski, and F. Toni. Abductive logic programming. Journal of Logic and Computation, 2(6):719–770, Dec. 1992. CrossRef
 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.
 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 25Year Perespective, pages 375–398. Springer, 1999.
 I. S. Mumick, H. Pirahesh, and R. Ramakrishnan. The magic of duplicates and aggregates. In D. McLeod, R. SacksDavis, and H.J. Schek, editors, 16th International Conference on Very Large Data Bases, pages 264–277. Morgan Kaufmann, 1990.
 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. CrossRef
 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. SpringerVerlag, 1999.
 K. A. Ross and Y. Sagiv. Monotonic aggregation in deductive databases. Journal of Computer and System Sciences, 54(1):79–97, 1997. CrossRef
 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.
 A. Van Gelder. The wellfounded semantics of aggregation. In Proceedings of the Eleventh ACM Symposium on Principles of Database Systems, pages 127–138. ACM Press, 1992.
 A. Van Gelder. Foundations of aggregation in deductive databases. In S. Ceri, K. Tanaka, and S. Tsur, editors, Third International Conference on Deductive and ObjectOriented Databases, volume 760of Lecture Notes in Computer Science, pages 13–34. SpringerVerlag, 1993.
 A. Van Gelder, K. A. Ross, and J. S. Schlipf. The wellfounded semantics for general logic programs. Journal of the ACM, 38(3):620–650, 1991. CrossRef
 B. Van Nuffelen and M. Denecker. Problem solving in IDlogic 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.
 Title
 Ultimate WellFounded and Stable Semantics for Logic Programs with Aggregates
 Book Title
 Logic Programming
 Book Subtitle
 17thInternational Conference, ICLP 2001 Paphos, Cyprus, November 26 – December 1, 2001 Proceedings
 Pages
 pp 212226
 Copyright
 2001
 DOI
 10.1007/354045635X_22
 Print ISBN
 9783540429357
 Online ISBN
 9783540456353
 Series Title
 Lecture Notes in Computer Science
 Series Volume
 2237
 Series ISSN
 03029743
 Publisher
 Springer Berlin Heidelberg
 Copyright Holder
 SpringerVerlag Berlin Heidelberg
 Additional Links
 Topics
 Industry Sectors
 eBook Packages
 Editors

 Philippe Codognet ^{(4)}
 Editor Affiliations

 4. LIP6, case 169, University of Paris 6
 Authors

 Marc Denecker ^{(5)}
 Nikolay Pelov ^{(5)}
 Maurice Bruynooghe ^{(5)}
 Author Affiliations

 5. Dept. of Computer Science, K.U.Leuven, Celestijnenlaan 200A, B3001, Heverlee, Belgium
Continue reading...
To view the rest of this content please follow the download PDF link above.