749 search results - page 17 / 150 » Dualities for Constraint Satisfaction Problems |
CP
1999
Springer
14 years 3 months ago
1999
Springer
Reformulating constraint satisfaction problems (CSPs) in lower arity is a common procedure when computing consistency. Lower arity CSPs are simpler to treat than high arity CSPs. ...
CSL
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. We define an abstract pebble game that provides game interpretations for essentially all known consistency algorithms for constraint satisfaction problems including arc-...
FOCS
1999
IEEE
14 years 3 months ago
1999
IEEE
We present a simple probabilistic algorithm for solving kSAT, and more generally, for solving constraint satisfaction problems (CSP). The algorithm follows a simple localsearch pa...
SAT
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. SAT Modulo Theories (SMT) consists of deciding the satisfiability of a formula with respect to a decidable background theory, such as linear integer arithmetic, bit-vect...
CP
1995
Springer
14 years 2 months ago
1995
Springer
A distributed constraint satisfaction problem (Distributed CSP) is a CSP in which variables and constraints are distributed among multiple automated agents, and various application...