Sciweavers

20 search results - page 1 / 4
» Operational Equivalence of CHR Programs and Constraints
Sort
View
PPDP
2010
Springer
13 years 2 months ago
Semantics-preserving translations between linear concurrent constraint programming and constraint handling rules
The Constraint Simplification Rules (CSR) subset of CHR and the flat subset of LCC, where agent nesting is restricted, are very close syntactically and semantically. The first con...
Thierry Martinez
CP
1999
Springer
13 years 9 months ago
Operational Equivalence of CHR Programs and Constraints
Slim Abdennadher, Thom W. Frühwirth
ICLP
2005
Springer
13 years 10 months ago
Guard and Continuation Optimization for Occurrence Representations of CHR
Constraint Handling Rules (CHR) is a high-level rule-based language extension, commonly embedded in Prolog. We introduce a new occurrence representation of CHR programs, and a new ...
Jon Sneyers, Tom Schrijvers, Bart Demoen
PPDP
2007
Springer
13 years 11 months ago
Unfolding in CHR
Program transformation is an appealing technique which allows to improve run-time efficiency, space-consumption and more generally to optimize a given program. Essentially it con...
Paolo Tacchella, Maurizio Gabbrielli, Maria Chiara...
CP
2005
Springer
13 years 6 months ago
A Linear-Logic Semantics for Constraint Handling Rules
One of the attractive features of the Constraint Handling Rules (CHR) programming language is its declarative semantics where rules are read as formulae in first-order predicate l...
Hariolf Betz, Thom W. Frühwirth