no code implementations • 27 Apr 2016 • Martin C. Cooper, Stanislav Živný
Characterising tractable fragments of the constraint satisfaction problem (CSP) is an important challenge in theoretical computer science and artificial intelligence.
no code implementations • 18 Sep 2015 • Serge Gaspers, Neeldhara Misra, Sebastian Ordyniak, Stefan Szeider, Stanislav Živný
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 instances that belong to different base classes; the union of the base classes forms a heterogeneous base class.
no code implementations • 23 Jan 2014 • Martin C. Cooper, Stanislav Živný
The minimisation problem of a sum of unary and pairwise functions of discrete variables is a general NP-hard problem with wide applications such as computing MAP configurations in Markov Random Fields (MRF), minimising Gibbs energy, or solving binary Valued Constraint Satisfaction Problems (VCSPs).
no code implementations • 10 Jul 2013 • David A. Cohen, Peter G. Jeavons, Evgenij Thorstensen, Stanislav Živný
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 parametrised algorithm.
