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 expressiveness of the language. In this paper, we describe an implementation based on source-to-source transformations to CHR (extended with some low-level compiler directives). We allow user-defined aggregates and nested aggregate expressions over arbitrary guarded conjunctions of constraints. Both an on-demand and an incremental aggregate computation strategy are supported. acceptance rate = 43.3% ispartof: pages:59-73 ispartof: Lecture notes in computer science vol:4915 pages:59-73 ispartof: International Symposium on Logic-Based Program Synthesis and Transformation location:Kongens Lyngby, Denmark date:23 Aug - 24 Aug 2007 status: published