Rewriting optimization statements in answer-set programs

Tutkimustuotos: Artikkeli kirjassa/konferenssijulkaisussavertaisarvioitu



  • University of Potsdam


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.


OtsikkoTechnical Communications of the 32nd International Conference on Logic Programming, ICLP 2016
ToimittajatManuel Carro, Andy King, Neda Saeedloei, Marina De Vos
TilaJulkaistu - 1 marraskuuta 2016
OKM-julkaisutyyppiA4 Artikkeli konferenssijulkaisuussa
TapahtumaInternational Conference on Logic Programming - New York City, Yhdysvallat
Kesto: 16 lokakuuta 201621 lokakuuta 2016
Konferenssinumero: 32


ConferenceInternational Conference on Logic Programming
KaupunkiNew York City

Lataa tilasto

Ei tietoja saatavilla

ID: 9934982