Modelling Search Strategies in Rules2CP [chapter]

François Fages, Julien Martin
2009 Lecture Notes in Computer Science  
In this abstract, we present a rule-based modelling language for constraint programming, called Rules2CP [1], and a library PKML for modelling packing problems. Unlike other modelling languages, Rules2CP adopts a single knowledge representation paradigm based on logical rules without recursion, and a restricted set of data structures based on records and enumerated lists given with iterators. We show that this is sufficient to model constraint satisfaction problems together with search
more » ... s, where search trees are expressed by logical formulae, and heuristic choice criteria are defined by preference orderings on variables and formulae. Rules2CP statements are compiled to constraint programs over finite domains (currently SICStus-prolog and soon Choco-Java) by term rewriting and partial evaluation. The Packing Knowledge Modelling Language (PKML) is a Rules2CP library developed in the European project Net-WMS for dealing with real size nonpure bin packing problems in logistics and automotive industry. PKML refers to shapes in Z K . A point in this space is represented by the list of its K integer coordinates. A shape is a rigid assembly of boxes, represented by a record. A box is an orthotope in Z K
doi:10.1007/978-3-642-01929-6_28 fatcat:hatukanlvzg2vohl74mfaiwfpm