6 search results - page 1 / 2 » Backdoors to tractable answer set programming |
CORR
2011
Springer
12 years 8 months ago
2011
Springer
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 ā...
CPAIOR
2009
Springer
13 years 11 months ago
2009
Springer
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...
ICTAI
2006
IEEE
13 years 10 months ago
2006
IEEE
In this paper a new approach for computing Strong Backdoor sets of boolean formula in conjunctive normal form (CNF) is proposed. It makes an original use of local search technique...
KR
2010
Springer
13 years 9 months ago
2010
Springer
Cardinality constraints or, more generally, weight constraints are well recognized as an important extension of answer-set programming. Clearly, all common algorithmic tasks relat...
CPAIOR
2011
Springer
12 years 8 months ago
2011
Springer
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...