Results 11 to 20 of about 5,971,608 (284)
A study of encodings of constraint satisfaction problems with 0/1 variables [PDF]
, 2003 Many constraint satisfaction problems (csp's) are formulated with 0/1 variables. Sometimes this is a natural encoding, sometimes it is as a result of a reformulation of the problem, other times 0/1 variables make up only a part of the problem. Frequently
Selensky, E., Prosser, P.
core +9 more sources
Phase transition behaviour in constraint satisfaction problems [PDF]
, 1997 Many problems in artificial intelligence and computer science can be formulated as constraint satisfaction problems (CSPs). A CSP consists of a set of variables among which a set of constraints are imposed, with a solution corresponding to an assignment ...
Grant, Stuart Alexander
core +7 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
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 +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
Prioritised fuzzy constraint satisfaction problems: axioms, instantiation and validation [PDF]
, 2003 This paper identifies a generic axiom framework for prioritised fuzzy constraint satisfaction problems (PFCSPs), and proposes methods to instantiate it (i.e., to construct specific schemes which obey the generic axiom framework).
Luo, X. +14 more
core +2 more sources
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