858 search results - page 32 / 172 » A Glimpse of Constraint Satisfaction |
120
Voted
SAT
2010
Springer
15 years 9 days 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...
121
click to vote
CPAIOR
2006
Springer
15 years 5 months ago
2006
Springer
We show that various duals that occur in optimization and constraint satisfaction can be classified as inference duals, relaxation duals, or both. We discuss linear programming, su...
112
click to vote
ECCC
2006
15 years 1 months ago
2006
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...
139
click to vote
AAAI
1996
15 years 3 months ago
1996
Learning during backtrack search is a space-intensive process that records information (such as additional constraints) in order to avoid redundant work. In this paper, we analyze...
129
click to vote
AUSAI
2003
Springer
15 years 7 months ago
2003
Springer
The distributed constraint satisfaction problem (CSP) is a general formalisation used to represent problems in distributed multiagent systems. To deal with realistic problems, mult...