Share This Author
Minion: A Fast Scalable Constraint Solver
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.
Essence: A constraint language for specifying combinatorial problems
- Alan M. Frisch, Warwick Harvey, Christopher Jefferson, B. M. Hernández, I. Miguel
- Computer Science, MathematicsConstraints
- 6 January 2007
Essence is a formal language for specifying combinatorial problems in a manner similar to natural rigorous specifications that use a mixture of natural language and discrete mathematics. Essence…
Symmetry Definitions for Constraint Satisfaction Problems
- David A. Cohen, P. Jeavons, Christopher Jefferson, K. Petrie, Barbara M. Smith
- Computer ScienceConstraints
- 1 October 2005
The many different definitions of symmetry for constraint satisfaction problems (CSPs) are reviewed, and it is shown that a symmetry can be defined in two fundamentally different ways: as an operation preserving the solutions of a CSP instance, or else as anoperation preserving the constraints.
Data Structures for Generalised Arc Consistency for Extensional Constraints
This work describes the use of two alternative data structures for maintaining generalised arc consistency on extensional constraints, both in GAC-schema, and in the watched-literal table constraint in Minion.
Complexity of n-Queens Completion
The n-Queens problem has been very widely used as a benchmark in Artificial Intelligence, but conclusions on it are often disputable because of the simple complexity of the decision problem, so these results give alternative benchmarks which are hard theoretically and empirically, but for which solving techniques designed for n- Queens need minimal or no change.
The Rules of Constraint Modelling
- Alan M. Frisch, Christopher Jefferson, B. M. Hernández, I. Miguel
- Business, Computer ScienceIJCAI
- 30 July 2005
Experimental results demonstrate that CONJURE is able to generate a variety of models for practical problems from their ESSENCE specifications, and refines a specification of a problem in the abstract constraint specification language E SSENCE into a set of alternative constraint models.
A Preliminary Review of Literature on Parallel Constraint Solving
An incomplete, biased, and ill-written review of the literature in constraints on exploitation of parallel systems for constraint solving, which may provide some useful pointers to others wishing to follow a similar path to us.
Watched Literals for Constraint Propagation in Minion
It is shown that watched literals, already a great success in the satisfiability community, can be used to provide highly efficient implementations of constraint propagators.
Automatically improving constraint models in Savile Row
An automated approach to generating efficient constraint solvers
- D. Balasubramaniam, Christopher Jefferson, Lars Kotthoff, I. Miguel, P. Nightingale
- Computer Science34th International Conference on Software…
- 2 June 2012
A novel, automated, model-driven approach to generating efficient solvers tailored to individual problems and the ability to solve larger and more difficult problems as a result of applying finer-grained optimisations and using specialised techniques as required is described.