1300 search results - page 25 / 260 » Constraint satisfaction problems and global cardinality cons... |
106
click to vote
BPSC
2009
14 years 10 months ago
2009
Abstract: In this paper we present our ideas to apply constraint satisfaction on business processes. We propose a multi-level constraint satisfaction approach to handle t levels of...
CSL
2009
Springer
15 years 4 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
15 years 1 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
14 years 8 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...
104
Voted
AISC
2004
Springer
15 years 3 months ago
2004
Springer
Nonlinear constraint systems can be solved by combining consistency techniques and search. In this approach, the search space is reduced using local reasoning on constraints. Howev...