From Rules to Constraint Programs with the Rules2CP Modelling Language - Archive ouverte HAL Access content directly
Reports (Research Report) Year : 2008

From Rules to Constraint Programs with the Rules2CP Modelling Language

(1) , (1)
1
Francois Fages
Julien Martin
  • Function : Author
  • PersonId : 758991
  • IdRef : 140830529

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.
Fichier principal
Vignette du fichier
FM08rr.pdf (432.43 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00270326 , version 1 (07-04-2008)
inria-00270326 , version 2 (11-04-2008)

Identifiers

  • HAL Id : inria-00270326 , version 2

Cite

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

Share

Gmail Facebook Twitter LinkedIn More