Volume 2237 of the series Lecture Notes in Computer Science pp 212226
Ultimate WellFounded and Stable Semantics for Logic Programs with Aggregates
 Marc DeneckerAffiliated withDept. of Computer Science, K.U.Leuven
 , Nikolay PelovAffiliated withDept. of Computer Science, K.U.Leuven
 , Maurice BruynoogheAffiliated withDept. of Computer Science, K.U.Leuven
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.
 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.