Share This Author
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…
Groups and Constraints: Symmetry Breaking during Search
We present an interface between the ECLiPSe constraint logic programming system and the GAP computational abstract algebra system. The interface provides a method for efficiently dealing with large…
Generic SBDD Using Computational Group Theory
We introduce a novel approach for symmetry breaking by dominance detection (SBDD). The essence of SBDD is to perform 'dominance checks' at each node in a search tree to ensure that no symmetrically…
Computing Two-Dimensional Integer Hulls
- Warwick Harvey
- Computer Science, MathematicsSIAM J. Comput.
- 1 August 1999
It is proven that the integer hull has at most O(n log Amax) inequalities, where n is the number of input inequalities and Amax is the magnitude of the largest input coefficient.
Improving Linear Constraint Propagation by Changing Constraint Representation
This paper investigates how linear integer constraints should be represented in order that propagation can determine strong domain information, and identifies two kinds of substitution which can improve propagation solvers, and can never weaken the domain information.
Finite Domain Bounds Consistency Revisited
- Chiu Wo Choi, Warwick Harvey, Jimmy Ho-man Lee, Peter James Stuckey
- Computer ScienceAustralian Conference on Artificial Intelligence
- 6 December 2004
This work clarifies the differences among the three commonly used notions of bounds consistency in the literature by defining (for the first time) the a priori behavior of bounds propagators on arbitrary constraints.
An Overview of HAL
- Bart Demoen, M. G. D. L. Banda, Warwick Harvey, K. Marriott, Peter James Stuckey
- Computer ScienceCP
- 11 October 1999
HAL provides a well-defined solver interface, mutable global variables for implementing a constraint store, and dynamic scheduling for combining, extending and writing new constraint solvers and supports semi-optional type, mode and determinism declarations.
Herbrand Constraint Solving in HAL
Constraints for Breaking All Row and Column Symmetries in a Three-by-Two Matrix
Constraint programs containing a matrix of two (or more) dimensions of decision variables often have row and column symmetries: in any assignment to the variables, the values assigned to any two rows…
Solving the MOLR and Social Golfers Problems
A construction that allows us to search for solutions of a particular form with much reduced effort, and a seeding heuristic for the MOLR problem that allows a local search approach to find much better solutions than would be possible otherwise.