Marc Denecker, Nikolay Pelov, Maurice Bruynooghe  Home/Search
Context Related
Links: ACM DBLP | cs.kuleuven.ac.be/~dtai/p...35881.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cs.kuleuven.ac.be/...2001E.shtml (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
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 xpoint theory of stable and wellfounded xpoints of non-monotone operators in a complete lattice. We de ne the syntax of logic programs with aggregates and de ne the immediate consequence operator of such programs. We investigate the wellfounded and stable semantics generated by Approximation Theory. We show that our... (Update)
Context of citations to this paper: More
...theory is the ease with which it can be applied in any context where semantics emerge as xpoints of operators. For example, in [ Denecker et al. 2001b ] approximation theory was applied in the context of aggregate logic programs and a family of semantics Kripke Kleene,...
Cited by: More
Smodels with CLP - A Treatment of Aggregates in ASP - Pontelli, Son (2003) (Correct)
Compositionality Results for Stratified Nonmonotone Operators - Gilis, Denecker (2002) (Correct)
Active bibliography (related documents): More All
0.5: Using Tabling to Extend Prolog with Non-Monotonic Constructs - Swift (Correct)
0.4: What is in a model? Epistemological ambiguity of Logic Programming - Denecker (Correct)
0.3: Pushing Extrema Aggregates to Optimize Logic Queries - Greco (2002) (Correct)
Similar documents based on text: More All
1.0: Ultimate Well-founded and Stable Semantics for Logic.. - Denecker, Pelov.. (2001) (Correct)
0.8: Translation of Aggregate Programs to Normal Logic Programs - Pelov, Denecker, Bruynooghe (2003) (Correct)
0.7: Partial Stable Models for Logic Programs with Aggregates - Pelov, Denecker, Bruynooghe (2004) (Correct)
BibTeX entry: (Update)
Marc Denecker, Nikolay Pelov, and Maurice Bruynooghe. Ultimate wellfounded and stable semantics for logic programs with aggregates. In International Conference on Logic Programming, pages 212-226, 2001. http://citeseer.ist.psu.edu/article/denecker01ultimate.html More
@article{ denecker01ultimate,
author = "M. Denecker and N. Pelov and M. Bruynooghe",
title = "Ultimate Well-Founded and Stable Semantics for Logic Programs with Aggregates",
journal = "Lecture Notes in Computer Science",
volume = "2237",
pages = "212--??",
year = "2001",
url = "citeseer.ist.psu.edu/article/denecker01ultimate.html" }
Citations (may not include all citations):858 The stable model semantics for logic programming - Gelfond, Lifschitz - 1988 DBLP
234 The well-founded semantics for general logic programs - Van Gelder, Ross et al. - 1991 ACM DBLP
212 Abductive logic programming - Kakas, Kowalski et al. - 1992 DBLP
120 Bilattices and the semantics of logic programming - Fitting - 1991 ACM DBLP
90 Stable models and an alternative logic programming paradigm - Marek, Truszczy - 1999
61 Monotonic aggregation in deductive databases - Ross, Sagiv - 1997 ACM DBLP
54 Low-complexity aggregation in GraphLog and Datalog - Consens, Mendelzon - 1993 ACM
50 The magic of duplicates and aggregates - Mumick, Pirahesh et al. - 1990 ACM DBLP
46 Logic programs with stable model semantics as a constraint p.. (context) - Niemel - 1999 DBLP
40 Semantics of logic programs with aggregates - Kemp, Stuckey - 1991 DBLP
19 well-founded xpoints and applications in non-monotonic reaso.. (context) - Denecker, Marek et al. - 2000
18 The well-founded semantics is the principle of inductive den.. - Denecker - 1998
14 Logic programming revisited: logic programs as inductive den.. - Denecker, Bruynooghe et al. - 2001
14 Extending the wellfounded and valid semantics for aggregatio.. - Sudarshan, Srivastava et al. - 1993
12 Uniform semantic treatment of default and autoepistemic logi.. - Denecker, Marek et al. - 2000 ACM DBLP
12 The well-founded semantics of aggregation (context) - Van Gelder - 1992 ACM DBLP
9 Stable model semantics of weight constraint rules (context) - Niemel, Simons et al. - 1999 ACM DBLP
8 Extending classical logic with inductive denitions (context) - Denecker - 2000
6 Foundations of aggregation in deductive databases (context) - Van Gelder - 1993 DBLP
5 On well-behaved semantics suitable for aggregation (context) - Dix, Osorio - 1997 DBLP
5 Department of Computer Science (context) - Denecker, Marek et al. - 2001
2 Problem solving in ID-logic with aggregates: some experiment.. (context) - Van Nu, Denecker - 2000
Documents on the same site (http://www.cs.kuleuven.ac.be/~dtai/publications/2001-E.shtml): More
On Termination of Meta-Programs - Serebrenik (2001) (Correct)
Techniques for on- and Off-Line Specialisation of Logic Programs - Vanhoof (Correct)
On Termination of Meta-Programs - Serebrenik, De Schreye (2001) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC