Skip to Main content Skip to Navigation

From Rules to Constraint Programs with the Rules2CP Modelling Language

Abstract : In this paper, we show that the business rules knowledge representation paradigm, which is widely used in the industry, can be developped as a front-end modelling language for constraint programming. We present a general purpose rule-based modelling language, called Rules2CP, and describe its compilation to constraint programs over finite domains with reified and global constraints, using term rewriting and partial evaluation. We prove the confluence of these transformations and provide a complexity bound on the size of the generated programs. The expressiveness of Rules2CP is illustrated with a complete library for packing problems, called PKML, which, in addition to pure bin packing and bin design problems, can deal with common sense rules about weights, stability, as well as specific packing business rules which compile efficiently into constraints.
Document type :
Complete list of metadata
Contributor : François Fages Connect in order to contact the contributor
Submitted on : Friday, April 11, 2008 - 4:11:44 PM
Last modification on : Friday, May 25, 2018 - 12:02:03 PM
Long-term archiving on: : Friday, November 25, 2016 - 10:28:32 PM


Files produced by the author(s)


  • HAL Id : inria-00270326, version 2



Francois Fages, Julien Martin. From Rules to Constraint Programs with the Rules2CP Modelling Language. [Research Report] RR-6495, INRIA. 2008. ⟨inria-00270326v2⟩



Record views


Files downloads