• Publications
  • Influence
Minion: A Fast Scalable Constraint Solver
TLDR
Minion is a general-purpose constraint solver, with an expressive input language based on the common constraint modelling device of matrix models, which makes it a substantial step towards Puget's 'Model and Run' constraint solving paradigm. Expand
CSPLIB: A Benchmark Library for Constraints
TLDR
A model benchmark library should contain as diverse and large a set of problems as possible, be independent of any particular constraint solver, and contain neither just hard (nor just easy) problems. Expand
SATLIB: An Online Resource for Research on SAT
TLDR
An overview of SATLIB is given and its current set of benchmark problems are described, to encourage all members of the community to utilise it for their SAT-related research and to improve it by submitting new benchmark problems, SAT solvers, and bibliography entries. Expand
Towards an Understanding of Hill-Climbing Procedures for SAT
TLDR
Experimental evidence is provided to support the conjecture that neither greediness nor randomness is important in local hill-climbing procedures for propositional satisfiability and suggest that runtime scales less than simply exponentially in the problem size. Expand
Arc Consistency in SAT
TLDR
It is proved that the DP algorithm in SAT applied to the suport encoding behaves exactly like the MAC algorithm in CSP's, and that the local search algorithm WalkSAT can perform many times better on the support encoding than on the direct encoding. Expand
The Constrainedness of Search
TLDR
A parameter that measures the "constrainedness" of an ensemble of combinatorial problems is introduced, which generalizes a number of parameters previously used in different NP-complete problem classes and can be directly compared. Expand
Beyond NP: the QSAT phase transition
TLDR
It is shown that phase transition behavior similar to that observed in NP-complete problems likerandom 3-SAT occurs further up the polynomial hierarchy in problems like random 2-QSAT, and it is predicted that similar phase Transition behavior will occur in other PSPACEcomplete problemslike planning and game playing. Expand
The TSP Phase Transition
TLDR
It is shown that for random problems there is a rapid transition between soluble and insoluble instances of the decision problem at a critical value of this parameter, a natural parameter for the two-dimensional Euclidean traveling salesman problem. Expand
An Empirical Study of Dynamic Variable Ordering Heuristics for the Constraint Satisfaction Problem
TLDR
A comparison of the Bz and FF heuristics in forward checking algorithms applied to randomly-generated binary CSP's and the identification of promising new heuristic worthy of further investigation are presented. Expand
Symmetry Breaking in Constraint Programming
TLDR
This work describes a method for symmetry breaking during search (SBDS) in constraint programming that guarantees to return a unique solution from each set of symmetrically equivalent ones, which is the one found first by the variable and value ordering heuristics. Expand
...
1
2
3
4
5
...