License: Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/OASIcs.ICLP.2016.5
URN: urn:nbn:de:0030-drops-67362
URL: https://drops.dagstuhl.de/opus/volltexte/2016/6736/
Go to the corresponding OASIcs Volume Portal


Bomanson, Jori ; Gebser, Martin ; Janhunen, Tomi

Rewriting Optimization Statements in Answer-Set Programs

pdf-format:
OASIcs-ICLP-2016-5.pdf (0.6 MB)


Abstract

Constraints on Pseudo-Boolean (PB) expressions can be translated into Conjunctive Normal Form (CNF) using several known translations. In Answer-Set Programming (ASP), analogous expressions appear in weight rules and optimization statements. Previously, we have translated weight rules into normal rules, using normalizations designed in accord with existing CNF encodings. In this work, we rededicate such designs to rewrite optimization statements in ASP. In this context, a rewrite of an optimization statement is a replacement accompanied by a set of normal rules that together replicate the original meaning. The goal is partially the same as in translating PB constraints or weight rules: to introduce new meaningful auxiliary atoms that may help a solver in the search for (optimal) solutions. In addition to adapting previous translations, we present selective rewriting techniques in order to meet the above goal while using only a limited amount of new rules and atoms. We experimentally evaluate these methods in preprocessing ASP optimization statements and then searching for optimal answer sets. The results exhibit significant advances in terms of numbers of optimally solved instances, reductions in search conflicts, and shortened computation times. By appropriate choices of rewriting techniques, improvements are made on instances involving both small and large weights. In particular, we show that selective rewriting is paramount on benchmarks involving large weights.

BibTeX - Entry

@InProceedings{bomanson_et_al:OASIcs:2016:6736,
  author =	{Jori Bomanson and Martin Gebser and Tomi Janhunen},
  title =	{{Rewriting Optimization Statements in Answer-Set Programs}},
  booktitle =	{Technical Communications of the 32nd International Conference on Logic Programming (ICLP 2016)},
  pages =	{5:1--5:15},
  series =	{OpenAccess Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-007-1},
  ISSN =	{2190-6807},
  year =	{2016},
  volume =	{52},
  editor =	{Manuel Carro and Andy King and Neda Saeedloei and Marina De Vos},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2016/6736},
  URN =		{urn:nbn:de:0030-drops-67362},
  doi =		{10.4230/OASIcs.ICLP.2016.5},
  annote =	{Keywords: Answer-Set Programming, Pseudo-Boolean optimization, Translation methods}
}

Keywords: Answer-Set Programming, Pseudo-Boolean optimization, Translation methods
Collection: Technical Communications of the 32nd International Conference on Logic Programming (ICLP 2016)
Issue Date: 2016
Date of publication: 11.11.2016


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