AAAI Publications, Twenty-Sixth AAAI Conference on Artificial Intelligence

Font Size: 
Ordered Completion for Logic Programs with Aggregates
Vernon Asuncion, Yan Zhang, Yi Zhou

Last modified: 2012-07-14


In this paper, we show that first-order logic programs with monotone aggregates under the stable model semantics can be captured in classical first-order logic. More precisely, we extend the notion of ordered completion for logic programs with a large variety of aggregates so that every stable model of a program with aggregates corresponds to a classical model of its enhanced ordered completion, and vice versa.


Logic Programming; Aggregates; First-Order Logic; Answer Set Programming

Full Text: PDF