The Rules of Constraint Modelling

Abstract

Many and diverse combinatorial problems have been solved successfully using finite-domain constraint programming. However, to apply constraint programming to a particular domain, the problem must first be modelled as a constraint satisfaction or optimisation problem. Since constraints provide a rich language, typically many alternative models exist. Formulating a good model therefore requires a great deal of expertise. This paper describes CONJURE, a system that refines a specification of a problem in the abstract constraint specification language ESSENCE into a set of alternative constraint models. Refinement is compositional: alternative constraint models are generated by composing refinements of the components of the specification. Experimental results demonstrate that CONJURE is able to generate a variety of models for practical problems from their ESSENCE specifications. 1

Cite

Text

Frisch et al. "The Rules of Constraint Modelling." International Joint Conference on Artificial Intelligence, 2005.

Markdown

[Frisch et al. "The Rules of Constraint Modelling." International Joint Conference on Artificial Intelligence, 2005.](https://mlanthology.org/ijcai/2005/frisch2005ijcai-rules/)

BibTeX

@inproceedings{frisch2005ijcai-rules,
  title     = {{The Rules of Constraint Modelling}},
  author    = {Frisch, Alan M. and Jefferson, Christopher and Hernández, Bernadette Martínez and Miguel, Ian},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2005},
  pages     = {109-116},
  url       = {https://mlanthology.org/ijcai/2005/frisch2005ijcai-rules/}
}