License: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC BY-NC-ND 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ICLP.2011.1
URN: urn:nbn:de:0030-drops-31617
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2011/3161/
Gebser, Martin ;
Kaminski, Roland ;
Kaufmann, Benjamin ;
Schaub, Torsten
Multi-Criteria Optimization in Answer Set Programming
Abstract
We elaborate upon new strategies and heuristics for solving multi-criteria optimization problems via Answer Set Programming (ASP). In particular, we conceive a new solving algorithm, based on conflictdriven learning, allowing for non-uniform descents during optimization. We apply these techniques to solve realistic Linux package configuration problems. To this end, we describe the Linux package configuration tool aspcud and compare its performance with systems pursuing alternative approaches.
BibTeX - Entry
@InProceedings{gebser_et_al:LIPIcs:2011:3161,
author = {Martin Gebser and Roland Kaminski and Benjamin Kaufmann and Torsten Schaub},
title = {{Multi-Criteria Optimization in Answer Set Programming}},
booktitle = {Technical Communications of the 27th International Conference on Logic Programming (ICLP'11) },
pages = {1--10},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-31-6},
ISSN = {1868-8969},
year = {2011},
volume = {11},
editor = {John P. Gallagher and Michael Gelfond},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2011/3161},
URN = {urn:nbn:de:0030-drops-31617},
doi = {10.4230/LIPIcs.ICLP.2011.1},
annote = {Keywords: Answer Set Programming, Multi-Criteria Optimization, Linux Package Configuration}
}
Keywords: |
|
Answer Set Programming, Multi-Criteria Optimization, Linux Package Configuration |
Collection: |
|
Technical Communications of the 27th International Conference on Logic Programming (ICLP'11) |
Issue Date: |
|
2011 |
Date of publication: |
|
27.06.2011 |