Sciweavers

92 search results - page 9 / 19
» cp 2007
Sort
View
CP
2007
Springer
15 years 3 months ago
A Case for Simple SAT Solvers
As SAT becomes more popular due to its ability to handle large real-world problems, progress in efficiency appears to have slowed down over the past few years. On the other hand, w...
Jinbo Huang
CP
2007
Springer
15 years 3 months ago
Towards Robust CNF Encodings of Cardinality Constraints
Motivated by the performance improvements made to SAT solvers in recent years, a number of different encodings of constraints into SAT have been proposed. Concrete examples are th...
João P. Marques Silva, Inês Lynce
CP
2007
Springer
15 years 3 months ago
Breaking Value Symmetry
Symmetry is an important factor in solving many constraint satisfaction problems. One common type of symmetry is when we have symmetric values. We can eliminate such value symmetr...
Toby Walsh
CP
2007
Springer
15 years 3 months ago
GAC Via Unit Propagation
In this paper we argue that an attractive and potentially very general way of achieving generalized arc consistency (GAC) on a constraint is by using unit propagation (UP) over a C...
Fahiem Bacchus
CP
2007
Springer
15 years 3 months ago
Constructive Interval Disjunction
Shaving and constructive disjunction are two main refutation principles used in constraint programming. The shaving principle allows us to compute the singleton arc-consistency (SA...
Gilles Trombettoni, Gilles Chabert