From Non-Convex Aggregates to Monotone Aggregates in ASP

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

PDF - Accepted Version Restricted to Repository staff only Download (223kB)

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.

Item Type:	Book Chapter
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science Q Science > QA Mathematics > QA76 Computer software
Schools:	School of Computing and Engineering School of Computing and Engineering > High-Performance Intelligent Computing > Planning, Autonomy and Representation of Knowledge School of Computing and Engineering > High-Performance Intelligent Computing > Planning, Autonomy and Representation of Knowledge
Related URLs:	Author Conference
Depositing User:	Wolfgang Faber
Date Deposited:	24 Jun 2016 11:12
Last Modified:	28 Aug 2021 17:01
URI:	http://eprints.hud.ac.uk/id/eprint/28692

Downloads

Repository Staff Only: item control page

View Item