Modelling Search Strategies in Rules2CP
In this abstract, we present a rule-based modelling language for constraint programming, called Rules2CP , 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 strategies, 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.
KeywordsModelling Language Constraint Program Packing Problem Preference Ordering Global Constraint
- 1.Fages, F., Martin, J.: From rules to constraint programs with the Rules2CP modeling language. In: Proc. 13th International Workshop on Constraint Solving and Constraint Programming CSCLP 2008. Recent Advances in Constraints, Roma, Italy. LNCS (LNAI). Springer, Heidelberg (to appear) (2008)Google Scholar
- 2.Korf, R.E.: Optimal rectangle packing: New results. In: ICAPS, pp. 142–149 (2004)Google Scholar
- 3.Simonis, H., O’Sullivan, B.: Using global constraints for rectangle packing. In: Proceedings of the first Workshop on Bin Packing and Placement Constraints BPPC 2008, associated to CPAIOR 2008 (2008)Google Scholar