Work

Technical Communications of the 27th International Conference on Logic Programming, ICLP 2011:Editorial

Year: 2011
Type: conference-paper
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.
Language: English
Open Access status: green
OpenAlex ID: W2953285718
FWCI:
Cites: 349
Cited by:
Related to: 10