Translation of Aggregate Programs to Normal Logic Programs

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 twovalued and is also the well-founded model. Our definition of stratification is more general than the existing one and covers a strictly larger class of programs.

• Type: Conference
• Year: 2003
• Where: ASP
• Authors: Nikolay Pelov, Marc Denecker, Maurice Bruynooghe
• Keywords: Aggregate Programs, ASP 2003, Logic Programs, Partial Stable Model