LIPIcs.ICLP.2012.247.pdf
- Filesize: 495 kB
- 12 pages
Document
Preprocessing of Complex Non-Ground Rules in Answer Set Programming
Authors
-
Part of:
Volume:
Technical Communications of the 28th International Conference on Logic Programming (ICLP'12) (ICLP 2012)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: International Conference on Logic Programming (ICLP) - License:
Creative Commons Attribution-NoDerivs 3.0 Unported license
- Publication Date: 2012-09-05
Cite AsGet BibTex
Michael Morak and Stefan Woltran. Preprocessing of Complex Non-Ground Rules in Answer Set Programming. In Technical Communications of the 28th International Conference on Logic Programming (ICLP'12). Leibniz International Proceedings in Informatics (LIPIcs), Volume 17, pp. 247-258, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
https://doi.org/10.4230/LIPIcs.ICLP.2012.247
https://doi.org/10.4230/LIPIcs.ICLP.2012.247
Abstract
In this paper we present a novel method for preprocessing complex non-ground rules in answer set programming (ASP). Using a well-known result from the area of conjunctive query evaluation, we apply
hypertree decomposition to ASP rules in order to make the structure of rules more explicit to grounders. In particular, the decomposition of rules reduces the number of variables per rule, while on the other hand, additional predicates are required to link the decomposed rules together. As we show in this paper, this technique can reduce the size of the grounding significantly and thus improves the performance of ASP systems in certain cases. Using a prototype implementation and the benchmark suites of the Answer Set Programming Competition 2011, we perform extensive tests of our decomposition approach that clearly
show the improvements in grounding time and size.
Keywords
- answer set programming
- hypertree decomposition
- preprocessing
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads