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.
@InProceedings{gebser_et_al:LIPIcs.ICLP.2011.1, author = {Gebser, Martin and Kaminski, Roland and Kaufmann, Benjamin and Schaub, Torsten}, 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 = {Gallagher, John P. and Gelfond, Michael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICLP.2011.1}, 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} }
Feedback for Dagstuhl Publishing