Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

20

ASP
2003
Springer

favoriteEmaildiscussreport

195views Automated Reasoning» more ASP 2003»

Translation of Aggregate Programs to Normal Logic Programs

13 years 9 months ago

Translation of Aggregate Programs to Normal Logic Programs

Download sunsite.informatik.rwth-aachen.de

Abstract. We deﬁne a translation of aggregate programs to normal logic programs which preserves the set of partial stable models. We then deﬁne the classes of deﬁnite and stratiﬁed aggregate programs and show that the translation of such programs are, respectively, deﬁnite and stratiﬁed logic programs. Consequently these two classes of programs have a single partial stable model which is twovalued and is also the well-founded model. Our deﬁnition of stratiﬁcation is more general than the existing one and covers a strictly larger class of programs.

Nikolay Pelov, Marc Denecker, Maurice Bruynooghe

Real-time Traffic

Aggregate Programs | ASP 2003 | Logic Programs | Partial Stable Model |

claim paper

Related Content

» Semantics of disjunctive programs with monotone aggregates an operatorbased approach

» Properties and Applications of Programs with Monotone and Convex Constraints

» Stable models and difference logic

» Ordered Completion for FirstOrder Logic Programs on Finite Structures

» ASSAT computing answer sets of a logic program by SAT solvers

» Evaluating valuegraph translation validation for LLVM

» On the Existence of Answer Sets in Normal Extended Logic Programs

» Induction of Stable Models

» Stratified PartialOrder Logic Programming

Post Info
More Details (n/a)

Added	06 Jul 2010
Updated	06 Jul 2010
Type	Conference
Year	2003
Where	ASP
Authors	Nikolay Pelov, Marc Denecker, Maurice Bruynooghe

Comments (0)