Nikolay Pelov, Marc Denecker, Maurice Bruynooghe  Home/Search
Context
Related
| cs.kuleuven.ac.be/~dtai/p...40920.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/...2003E.shtml (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We define a translation of aggregate programs to normal logic programs which preserves the set of partial stable models. We then define the classes of definite and stratified aggregate programs and show that the translation of such programs are, respectively, definite and stratified logic programs. Consequently these two classes of programs have a single partial stable model which is two-valued and is also the wellfounded model. Our definition of stratification is more general than the... (Update)
Active bibliography (related documents): More All
1.4: Translation of Aggregate Programs to Normal Logic Programs - Pelov, Denecker, Bruynooghe (2003) (Correct)
0.8: Partial Stable Models for Logic Programs with Aggregates - Pelov, Denecker, Bruynooghe (2004) (Correct)
0.3: Aggregate Functions in DLV - Dell'Armi, Faber, Ielpa, Leone.. (2003) (Correct)
Similar documents based on text: More All
0.8: Ultimate Well-founded and Stable Semantics for Logic.. - Denecker, Pelov.. (2001) (Correct)
0.6: Extending Constraint Logic Programming with Open Functions - Pelov, Bruynooghe (2000) (Correct)
0.4: Logic Programming Approaches for Representing and Solving .. - Pelov, De Mot, Denecker (2000) (Correct)
BibTeX entry: (Update)
@misc{ pelov-translation,
author = "Nikolay Pelov and Marc Denecker and Maurice Bruynooghe",
title = "Translation of Aggregate Programs to Normal Logic Programs",
url = "citeseer.ist.psu.edu/pelov03translation.html" }
Citations (may not include all citations):858 The stable model semantics for logic programming - Gelfond, Lifschitz - 1988
435 Towards a theory of declarative knowledge (context) - Apt, Blair et al. - 1988
204 the declarative semantics of deductive databases and logic p.. (context) - Przymusinski - 1988
174 A Kripke-Kleene semantics for logic programs (context) - Fitting - 1985
68 Extending and implementing the stable model semantics - Simons, Niemela et al. - 2002
50 The magic of duplicates and aggregates - Mumick, Pirahesh et al. - 1990
17 Aggregate functions in disjunctive logic programming: Semant.. (context) - Dell'Armi, Faber et al. - 2003
15 Weight constraints as nested expressions - Ferraris, Lifschitz - 2004
13 Representing knowledge in A-Prolog - Gelfond - 2002
12 well-founded fixpoints and applications in non-monotonic rea.. (context) - Denecker, Marek et al. - 2000
9 Ultimate approximations in nonmonotonic knowledge representa.. - Denecker, Marek et al. - 2002
5 Ultimate well-founded and stable model semantics for logic p.. (context) - Denecker, Pelov et al. - 2001
3 The well-founded semantics coincides with the three-valued s.. (context) - Przymusinksi - 1990
2 Partial stable semantics for logic programs with aggregates (context) - Pelov, Denecker et al. - 2004
Documents on the same site (http://www.cs.kuleuven.ac.be/~dtai/publications/2003-E.shtml): More
Uniform Semantic Treatment of Default and Autoepistemic Logics - Denecker (2000) (Correct)
Advanced Copy Propagation for Arrays - Vanbroekhoven, Janssens.. (2003) (Correct)
Proving Termination With Adornments - Serebrenik, De Schreye (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