Abstract
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 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. © 2009 Springer Berlin Heidelberg.
Cite
CITATION STYLE
Fages, F., & Martin, J. (2009). Modelling search strategies in Rules2CP. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5547 LNCS, pp. 321–322). https://doi.org/10.1007/978-3-642-01929-6_28
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
