Multi-Criteria Optimization in Answer Set Programming

The authors elaborate upon new strategies and heuristics for solving multi-criteria optimization problems via Answer Set Programming (ASP). In particular, they conceive a new solving algorithm, based on conflict-driven learning, allowing for non-uniform descents during optimization. They apply these techniques to solve realistic Linux package configuration problems. To this end, they describe the Linux package configuration tool aspcud and compare its performance with systems pursuing alternative approaches. They elaborate upon new strategies and heuristics for solving multi-criteria optimization problems via Answer Set Programming (ASP). In particular, they conceive a new solving algorithm, based on conflict-driven learning, allowing for non-uniform descents during optimization.

Provided by: Schloss Dagstuhl Topic: Software Date Added: Jun 2011 Format: PDF

Find By Topic