Rewriting optimization statements in answer-set programs

Jori Bomanson, Martin Gebser, Tomi Janhunen

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingsScientificpeer-review

6 Citations (Scopus)
78 Downloads (Pure)


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.

Original languageEnglish
Title of host publicationTechnical Communications of the 32nd International Conference on Logic Programming, ICLP 2016
EditorsManuel Carro, Andy King, Neda Saeedloei, Marina De Vos
PublisherSchloss Dagstuhl - Leibniz-Zentrum für Informatik
Number of pages15
ISBN (Electronic)9783959770071
Publication statusPublished - 1 Nov 2016
MoE publication typeA4 Conference publication
EventInternational Conference on Logic Programming - New York City, United States
Duration: 16 Oct 201621 Oct 2016
Conference number: 32


ConferenceInternational Conference on Logic Programming
Abbreviated titleICLP
Country/TerritoryUnited States
CityNew York City


  • Answer-set programming
  • Pseudo-Boolean optimization
  • Translation methods


Dive into the research topics of 'Rewriting optimization statements in answer-set programs'. Together they form a unique fingerprint.

Cite this