LIP6 1997/029
- Reports
Programmation par contraintes en CLIPS - J.-M. Labat, M. Futtersack
- 29 pages - 11/12/1997- document en - http://www.lip6.fr/lip6/reports/1997/lip6.1997.029.ps.gz - 47 Ko
- Contact : Jean-Marc.Labat (at) nulllip6.fr
- Ancien Thème : SYSDEF
- Keywords : constraints, CLIPS, CCP, CSP
- Publisher : Valerie.Mangin (at) nulllip6.fr
CCP (CLIPS Constraint Programming) is a generic knowledge base which enables CLIPS to solve CSPs (Constraint Satisfaction Problems). CCP is composed of three modules. The MAIN module contains the top level loop including the I/O rules. The SEARCH module implements a classical Chronological Backtrack algorithm. The PROPAGATION module implements the Forward Checking algorithm. CCP has been extensively tested with well known puzzles as N-queens, graph colouring, crosswords, etc. To implement any particular problem, the users only need to declare each variable with its domain and they have to define specific domain description and rules of propagation. So that all specific knowledge is encapsulated in the PROPAGATION module. CCP is a generic tool that can be embedded in a knowledge based system like a work horse for local CSPs solving. CCP is compact, since it contains only a dozen rules. Moreover, CCP can be seen as a pedagogical tool illustrating many advanced features of CLIPS (logical dependencies, forall, exists conditional elements, the built function and a control strategy based on the focus stack).