[图书][B] Constraint handling rules
T Frühwirth - 2009 - books.google.com
Constraint Handling Rules (CHR) is both a theoretical formalism based on logic and a
practical programming language based on rules. This book, written by the creator of CHR …
practical programming language based on rules. This book, written by the creator of CHR …
As time goes by: constraint handling rules: a survey of CHR research from 1998 to 2007
Constraint Handling Rules (CHR) is a high-level programming language based on
multiheaded multiset rewrite rules. Originally designed for writing user-defined constraint …
multiheaded multiset rewrite rules. Originally designed for writing user-defined constraint …
The computational power and complexity of Constraint Handling Rules
Constraint Handling Rules (CHR) is a high-level rule-based programming language which
is increasingly used for general-purpose programming. We introduce the CHR machine, a …
is increasingly used for general-purpose programming. We introduce the CHR machine, a …
Constraint handling rules-what else?
T Frühwirth - … Foundations, Tools, and Applications: 9th International …, 2015 - Springer
Abstract Constraint Handling Rules (CHR) is both an effective concurrent declarative
constraint-based programming language and a versatile computational formalism. While …
constraint-based programming language and a versatile computational formalism. While …
Efficient lazy evaluation of rule-based programs
P Van Weert - IEEE Transactions on Knowledge and Data …, 2009 - ieeexplore.ieee.org
Thirty years after Forgy's seminal dissertation, Rete remains the de facto standard matching
algorithm. Despite promising research results, alternative algorithms such as TREAT and …
algorithm. Despite promising research results, alternative algorithms such as TREAT and …
Aggregates for CHR through program transformation
We propose an extension of Constraint Handling Rules (CHR) with aggregates such as
sum, count, findall, and min. This new feature significantly improves the conciseness and …
sum, count, findall, and min. This new feature significantly improves the conciseness and …
The correspondence between the Logical Algorithms language and CHR
L De Koninck, T Schrijvers, B Demoen - International Conference on Logic …, 2007 - Springer
This paper investigates the relationship between the Logical Algorithms language (LA) of
Ganzinger and McAllester and Constraint Handling Rules (CHR). We present a translation …
Ganzinger and McAllester and Constraint Handling Rules (CHR). We present a translation …
Optimizing Compilation and Computational Complexity of Constraint Handling Rules: Ph. D. Thesis Summary
J Sneyers - … : 25th International Conference, ICLP 2009, Pasadena …, 2009 - Springer
Abstract Constraint Handling Rules [1, 2] is a high-level programming language extension
based on multi-headed committed-choice multiset rewrite rules. It can be used as a stand …
based on multi-headed committed-choice multiset rewrite rules. It can be used as a stand …
Logical Algorithms meets CHR: A meta-complexity result for Constraint Handling Rules with rule priorities
L De Koninck - Theory and Practice of Logic Programming, 2009 - cambridge.org
This paper investigates the relationship between the Logical Algorithms (LA) language of
Ganzinger and McAllester and Constraint Handling Rules (CHR). We present a translation …
Ganzinger and McAllester and Constraint Handling Rules (CHR). We present a translation …
Analysing graph transformation systems through constraint handling rules
F Raiser, T Frühwirth - Theory and Practice of Logic Programming, 2011 - cambridge.org
Graph transformation systems (GTS) and constraint handling rules (CHR) are non-
deterministic rule-based state transition systems. CHR is well known for its powerful …
deterministic rule-based state transition systems. CHR is well known for its powerful …