A filtering algorithm for constraints of difference in CSPs
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Automatic Generation of Implied Constraints
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
MINION: A Fast, Scalable, Constraint Solver
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Dual modelling of permutation and injection problems
Journal of Artificial Intelligence Research
The design of ESSENCE: a constraint language for specifying combinatorial problems
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
The rules of constraint modelling
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Propagation algorithms for lexicographic ordering constraints
Artificial Intelligence
CGRASS: a system for transforming constraint satisfaction problems
ERCIM'02/CologNet'02 Proceedings of the 2002 Joint ERCIM/CologNet international conference on Constraint solving and constraint logic programming
A study of encodings of constraint satisfaction problems with 0/1 variables
ERCIM'02/CologNet'02 Proceedings of the 2002 Joint ERCIM/CologNet international conference on Constraint solving and constraint logic programming
Watched literals for constraint propagation in minion
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
PADL'07 Proceedings of the 9th international conference on Practical Aspects of Declarative Languages
Generalised arc consistency for the AllDifferent constraint: An empirical survey
Artificial Intelligence
Modelling equidistant frequency permutation arrays: an application of constraints to mathematics
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Scheduling the CB1000 nanoproteomic analysis system with Python, Tailor, and Minion
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Efficient reasoning with RCC-3D
KSEM'10 Proceedings of the 4th international conference on Knowledge science, engineering and management
An integrated modelling, debugging, and visualisation environment for G12
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
The extended global cardinality constraint: An empirical survey
Artificial Intelligence
A delegation-based architecture for collaborative robotics
AOSE'10 Proceedings of the 11th international conference on Agent-oriented software engineering
Lazy explanations for constraint propagators
PADL'10 Proceedings of the 12th international conference on Practical Aspects of Declarative Languages
The extended global cardinality constraint: an empirical survey (extended abstract)
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.00 |
In order to apply constraint programming to a particular domain, the problem must first be modelled as a constraint satisfaction problem. There are typically many alternative models of a given problem, and formulating an effective model requires a great deal of expertise. To reduce this bottleneck, the ESSENCE language allows the specification of a problem abstractly, i.e. without making modelling decisions. This specification is refined automatically by the CONJURE system to a solver-independent constraint modelling language ESSENCE′. However, there is still significant work involved in translating an ESSENCE′ model for use with a particular constraint solver. This paper discusses this 'tailoring' process with reference to the constraint solver MINION.