License: Creative Commons Attribution-NoDerivs 3.0 Unported license (CC BY-ND 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ICLP.2012.247
URN: urn:nbn:de:0030-drops-36263
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2012/3626/
Go to the corresponding LIPIcs Volume Portal

Morak, Michael ; Woltran, Stefan

Preprocessing of Complex Non-Ground Rules in Answer Set Programming

pdf-format:
24.pdf (0.5 MB)

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.

BibTeX - Entry

@InProceedings{morak_et_al:LIPIcs:2012:3626,
  author =	{Michael Morak and Stefan Woltran},
  title =	{{Preprocessing of Complex Non-Ground Rules in Answer Set Programming}},
  booktitle =	{Technical Communications of the 28th International Conference on Logic Programming (ICLP'12)},
  pages =	{247--258},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-43-9},
  ISSN =	{1868-8969},
  year =	{2012},
  volume =	{17},
  editor =	{Agostino Dovier and V{\'i}tor Santos Costa},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2012/3626},
  URN =		{urn:nbn:de:0030-drops-36263},
  doi =		{10.4230/LIPIcs.ICLP.2012.247},
  annote =	{Keywords: answer set programming, hypertree decomposition, preprocessing}
}

Keywords: answer set programming, hypertree decomposition, preprocessing
Collection: Technical Communications of the 28th International Conference on Logic Programming (ICLP'12)
Issue Date: 2012
Date of publication: 05.09.2012

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI