Results 11 to 20 of about 15,021 (304)
Logical compactness and constraint satisfaction problems [PDF]
Logical Methods in Computer Science, 2017 We investigate a correspondence between the complexity hierarchy of constraint satisfaction problems and a hierarchy of logical compactness hypotheses for finite relational structures.
Danny Rorabaugh +2 more
doaj +2 more sources
Dualities for Constraint Satisfaction Problems [PDF]
, 2008 In a nutshell, a duality for a constraint satisfaction problem equates the existence of one homomorphism to the non-existence of other homomorphisms. In this survey paper, we give an overview of logical, combinatorial, and algebraic aspects of the following forms of duality for constraint satisfaction problems: finite duality, bounded pathwidth duality,
Andrei A. Bulatov +2 more
openaire +3 more sources
Random Constraint Satisfaction Problems [PDF]
Electronic Proceedings in Theoretical Computer Science, 2009 Random instances of constraint satisfaction problems such as k-SAT provide challenging benchmarks. If there are m constraints over n variables there is typically a large range of densities r=m/n where solutions are known to exist with probability close ...
Amin Coja-Oghlan
doaj +1 more source
The Complexity of Combinations of Qualitative Constraint Satisfaction Problems [PDF]
Logical Methods in Computer Science, 2020 The CSP of a first-order theory $T$ is the problem of deciding for a given finite set $S$ of atomic formulas whether $T \cup S$ is satisfiable. Let $T_1$ and $T_2$ be two theories with countably infinite models and disjoint signatures.
Manuel Bodirsky, Johannes Greiner
doaj +1 more source
Locked Constraint Satisfaction Problems [PDF]
Physical Review Letters, 2008 4 pages, 2 ...
Zdeborová, Lenka, Mézard, Marc
openaire +4 more sources
Applying quantum algorithms to constraint satisfaction problems [PDF]
Quantum, 2019 Quantum algorithms can deliver asymptotic speedups over their classical counterparts. However, there are few cases where a substantial quantum speedup has been worked out in detail for reasonably-sized problems, when compared with the best classical ...
Earl Campbell +2 more
doaj +1 more source
A Characterisation of First-Order Constraint Satisfaction Problems [PDF]
Logical Methods in Computer Science, 2007 We describe simple algebraic and combinatorial characterisations of finite relational core structures admitting finitely many obstructions. As a consequence, we show that it is decidable to determine whether a constraint satisfaction problem is first ...
Benoit Larose +2 more
doaj +1 more source
Linear Phase Transition in Random Linear Constraint Satisfaction Problems [PDF]
Discrete Mathematics & Theoretical Computer Science, 2003 Our model is a generalized linear programming relaxation of a much studied random K-SAT problem. Specifically, a set of linear constraints $C$ on $K$ variables is fixed.
David Gamarnik
doaj +1 more source
Graph Neural Networks for Maximum Constraint Satisfaction
Frontiers in Artificial Intelligence, 2021 Many combinatorial optimization problems can be phrased in the language of constraint satisfaction problems. We introduce a graph neural network architecture for solving such optimization problems.
Jan Tönshoff +3 more
doaj +1 more source
The complexity of global cardinality constraints [PDF]
Logical Methods in Computer Science, 2010 In a constraint satisfaction problem (CSP) the goal is to find an assignment of a given set of variables subject to specified constraints. A global cardinality constraint is an additional requirement that prescribes how many variables must be assigned a ...
Andrei A. Bulatov, Daniel Marx
doaj +1 more source