21st International Conference on Logic Programming, Date: 2005/10/02 - 2005/10/05, Location: Sitges, Spain
Logic Programming, ICLP 2005, Proceedings
Author:
Keywords:
Science & Technology, Technology, Computer Science, Theory & Methods, Computer Science
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.