A Framework for Expressing
Knowledge about Constraint Satisfaction Problems
Authors:
- Pierre Roy, Laforia-IBP, Université Paris 6, Boîte
169, 4, place Jussieu, 75252 Paris Cedex, France, roy@laforia.ibp.fr
- François Pachet, Laforia-IBP, Université Paris
6, Boîte 169, 4, place Jussieu, 75252 Paris Cedex, France,
pachet@laforia.ibp.fr
- Jean-François Perrot, Laforia-IBP, Université
Paris 6, Boîte 169, 4, place Jussieu, 75252 Paris Cedex,
France, jfp@laforia.ibp.fr
Abstract:
This paper describes a framework for expressing and solving combinatorial
problems. The framework is especially designed to allow the expression
of various types of knowledge on problem domains, that can be
exploited by the resolution mechanism to speed up the search.
We illustrate the framework and the types of knowledge on a crossword
example.
Keywords:
Constraint satisfaction; Knowledge representation; Object-oriented
programming; Crosswords.