From Non-Convex Aggregates to Monotone Aggregates in ASP
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence. Pages 4100-4193.
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.
@inproceedings{ijcai2016p610,
title = {From Non-Convex Aggregates to Monotone Aggregates in ASP},
author = {Alviano, Mario and Faber, Wolfgang and Gebser, Martin},
booktitle = {Proceedings of the Twenty-Fifth International Joint Conference on
Artificial Intelligence, {IJCAI-16}},
publisher = {AAAI Press / International Joint Conferences on Artificial Intelligence},
editor = {Subbarao Kambhampati},
pages = {4100--4193},
year = {2016},
month = {7},
url = {https://ijcai.org/proceedings/2016/610},
}
TY - CPAPER TI - From Non-Convex Aggregates to Monotone Aggregates in ASP AU - Alviano, Mario AU - Faber, Wolfgang AU - Gebser, Martin T2 - Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI-16 PB - AAAI Press / International Joint Conferences on Artificial Intelligence PY - 2016 SP - 4100 EP - 4193 UR - https://ijcai.org/proceedings/2016/610 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
