From non-convex aggregates to monotone aggregates in ASP

Mario Alviano, Wolfgang Faber, Martin Gebser

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationProceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence
Subtitle of host publication(IJCAI-16)
EditorsSubbarao Kambhampati
PublisherAAAI press
Pages4100-4104
Number of pages5
Volume2
ISBN (Print)9781577357711, 157735771X
Publication statusPublished - 2016

    Fingerprint

Cite this

Alviano, M., Faber, W., & Gebser, M. (2016). From non-convex aggregates to monotone aggregates in ASP. In S. Kambhampati (Ed.), Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence: (IJCAI-16) (Vol. 2, pp. 4100-4104). AAAI press.