LIPIcs.ICLP.2011.1.pdf
- Filesize: 0.55 MB
- 10 pages
Document
Multi-Criteria Optimization in Answer Set Programming
Authors
-
Part of:
Volume:
Technical Communications of the 27th International Conference on Logic Programming (ICLP'11)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: International Conference on Logic Programming (ICLP) - License:
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
- Publication date: 2011-06-27
Cite AsGet BibTex
Martin Gebser, Roland Kaminski, Benjamin Kaufmann, and Torsten Schaub. Multi-Criteria Optimization in Answer Set Programming. In Technical Communications of the 27th International Conference on Logic Programming (ICLP'11). Leibniz International Proceedings in Informatics (LIPIcs), Volume 11, pp. 1-10, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2011)
https://doi.org/10.4230/LIPIcs.ICLP.2011.1
https://doi.org/10.4230/LIPIcs.ICLP.2011.1
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.
Keywords
- Answer Set Programming
- Multi-Criteria Optimization
- Linux Package Configuration
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads