Anzeige
Erschienen in:
2009 | OriginalPaper | Buchkapitel
Modelling Search Strategies in Rules2CP
verfasst von : François Fages, Julien Martin
Erschienen in: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.