We present a unifying approach to the efļ¬cient evaluation of propositional answer-set programs. Our approach is based on backdoors which are small sets of atoms that represent ā...
Cardinality constraints or, more generally, weight constraints are well recognized as an important extension of answer-set programming. Clearly, all common algorithmic tasks relat...
There has been considerable interest in the identiļ¬cation of structural properties of combinatorial problems that lead, directly or indirectly, to the development of eļ¬cient al...
Bistra N. Dilkina, Carla P. Gomes, Yuri Malitsky, ...
We argue that parameterized complexity is a useful tool with which to study global constraints. In particular, we show that many global constraints which are intractable to propag...
Christian Bessiere, Emmanuel Hebrard, Brahim Hnich...
In this work we present the Partner Units Problem as a novel challenge for optimization methods. It captures a certain type of conļ¬guration problem that frequently occurs in indu...
Markus Aschinger, Conrad Drescher, Gerhard Friedri...