Guard and continuation optimization for occurrence representations of CHR

Authors:
Jon Sneyers;Tom Schrijvers;Bart Demoen
Affiliations:
Dept. of Computer Science, K.U.Leuven, Belgium;Dept. of Computer Science, K.U.Leuven, Belgium;Dept. of Computer Science, K.U.Leuven, Belgium
Venue:
ICLP'05 Proceedings of the 21st international conference on Logic Programming
Year:
2005

Citing 3
Cited 4

Extending arbitrary solvers with constraint handling rules

Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
Abstract interpretation for constraint handling rules

PPDP '05 Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming
Optimizing compilation of constraint handling rules in HAL

Theory and Practice of Logic Programming

Constructing Rule-Based Solvers for Intentionally-Defined Constraints

Constraint Handling Rules
Guard Reasoning in the Refined Operational Semantics of CHR

Constraint Handling Rules
Analysis and optimization of CHR programs

ICLP'05 Proceedings of the 21st international conference on Logic Programming
Concurrent goal-based execution of constraint handling rules

Theory and Practice of Logic Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 operational semantics for occurrence representations, equivalent to the widely implemented refined operational semantics. The occurrence representation allows in a natural way to express guard and continuation optimizations, which remove redundant guards and eliminate redundant code for subsumed occurrences. These optimizations allow CHR programmers to write self-documented rules with a clear logical reading. We show correctness of both optimizations, present an implementation in the K.U.Leuven CHR compiler, and discuss speedup measurements.