77 citations · 733 across the 54 of their papers we have counts for
3 papers · 1 filter
Backdoors into Heterogeneous Classes of SAT and CSP
Serge Gaspers, Neeldhara Misra, Sebastian Ordyniak +2
In this paper we extend the classical notion of strong and weak backdoor sets for SAT and CSP by allowing that different instantiations of the backdoor variables result in instance…
Tractable Combinations of Global Constraints
David A. Cohen, Peter G. Jeavons, Evgenij Thorstensen +1
We study the complexity of constraint satisfaction problems involving global constraints, i.e., special-purpose constraints provided by a solver and represented implicitly by a par…
Hybrid tractability of soft constraint problems
Martin C. Cooper, Stanislav Zivny
The constraint satisfaction problem (CSP) is a central generic problem in computer science and artificial intelligence: it provides a common framework for many theoretical problems…