Talks and Poster Presentations (with Proceedings-Entry):
M. Morak, S. Woltran:
"Preprocessing of Complex Non-Ground Rules in Answer Set Programming";
Talk: International Conference on Logic Programming (ICLP),
- 09-08-2012; in: "Technical Communications of the 28th International Conference on Logic Programming",
A. Dovier, Vitor Costa (ed.);
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.
Created from the Publication Database of the Vienna University of Technology.