Alviano, Mario, Faber, Wolfgang and Gebser, Martin (2016) From Non-Convex Aggregates to Monotone Aggregates in ASP. In: 25th International Joint Conference on Artificial Intelligence (IJCAI-16). AAAI Press. ISBN 978-1-57735-771-1

In answer set programming, knowledge involving sets of objects collectively is naturally represented by aggregates, which are rewritten into simpler forms known as monotone aggregates by current implementations. However, there is a complexity gap between general and monotone aggregates. In this paper, this gap is filled by means of a polynomial, faithful, and modular translation function, which can introduce disjunction in rule heads. The translation function is now part of the recent version 4.5 of the grounder GRINGO . This paper focuses on the key points of the translation function, and in particular on the mapping from non-convex sums to monotone sums.

ijcai16.pdf - Accepted Version
Restricted to Repository staff only

Download (223kB)
Add to AnyAdd to TwitterAdd to FacebookAdd to LinkedinAdd to PinterestAdd to Email