17 search results - page 1 / 4 » Making constraint solvers more usable: overconstraint proble... |
CAD
2004
Springer
13 years 4 months ago
2004
Springer
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Programs to solve so-called constraint problems are complex pieces of software which require many design decisions to be made more or less arbitrarily by the implementer. These dec...
CP
2004
Springer
13 years 10 months ago
2004
Springer
In CP literature combinatorial design problems such as sport scheduling, Steiner systems, error-correcting codes and more, are typically solved using Finite Domain (FD) models desp...
AI
2008
Springer
13 years 5 months ago
2008
Springer
We make a number of contributions to the study of the Quantified Constraint Satisfaction Problem (QCSP). The QCSP is an extension of the constraint satisfaction problem that can b...
IJCAI
2003
13 years 6 months ago
2003
We present an algorithm Pref-AC that limits arc consistency (AC) to the preferred choices of a tree search procedure and that makes constraint solving more efficient without chan...