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

  • Marc Denecker
  • Nikolay Pelov
  • Maurice Bruynooghe
Conference paper

DOI: 10.1007/3-540-45635-X_22

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2237)
Cite this paper as:
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

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Marc Denecker
    • 1
  • Nikolay Pelov
    • 1
  • Maurice Bruynooghe
    • 1
  1. 1.Dept. of Computer ScienceK.U.LeuvenHeverleeBelgium

Personalised recommendations