A FRAMEWORK FOR EXPRESSING KNOWLEDGE ABOUT CONSTRAINT SATISFACTION PROBLEMS

This paper describes a framework for ex- pressing and solving combinatorial problems. The framework is especially designed to allow the expres- sion of various types of knowledge on problem do- mains, that can be exploited by the resolution mechan- ism to speed up the search. We illustrate the frame- work and the types of knowledge on a crossword example.