CHR 2007

Fourth Workshop on Constraint Handling Rules

Co-located with the International Conference on Logic Programming ICLP 2007

 September 8, 2007

Porto, Portugal


http://chr2007.workshops.free.fr

Introduction

The Constraint Handling Rules (CHR) language has become a major declarative specification and implementation language for constraint reasoning algorithms and applications. Algorithms are often specified using inference rules, rewrite rules, sequents, proof rules or logical axioms that can be directly written in CHR. Its clean semantics facilitates program design, analysis and transformation. See the CHR website (http://www.cs.kuleuven.be/~dtai/projects/CHR/) for more information.

Previous Workshops on Constraint Handling Rules were organized in May 2004 in Ulm (Germany), in October 2005 in Sitges (Spain) colocated with CP'05 and in July 2006 in Venice (Italy) colocated with ICALP'06.

Topics of Interest

The workshop calls for full papers and short papers describing ongoing work, on all aspects of CHR, including topics such as:

  •  Semantics
  •  Logical Algorithms
  •  Constraint Solvers
  •  Expressivity and Complexity
  •  Program Analysis
  •  Programming tools
  •  Implementations and Optimization
  •  Program Transformation and Generation
  •  Language Extensions (Types, Modules)
  •  Retractable Constraints
  •  Programming Pearls
  •  Programming Environments (Debugging)
  •  Applications
  •  Critical Assessment
  •  Comparisons with Related Approaches

 

Proceedings

The workshop proceedings have been published as a technical report.

Regular papers

A Linear-Logic Semantics for Constraint Handling Rules with Disjunction
Hariolf Betz , Thom Frühwirth

Relating Coloured Petri Nets to Constraint,Handling Rules
Hariolf Betz

On Confluence of Non-terminating CHR Programs
Frank Raiser and Paolo Tacchella

A new approach to termination analysis of constraint handling rules
Dean Voets, Paolo Pilozzi and  Danny De Schreye

Adaptive CHR meets CHR$^{\lor}$ : An Extended Refined Operational Semantics for CHR$^{\lor}$ Based-On Justifications
Armin Wolf, Jacques Robin, Jairson Vitorino

Aggregates for Constraint Handling Rules
Jon Sneyers, Peter Van Weert, Tom Schrijvers   

Join Ordering for Constraint Handling Rules
Leslie De Koninck and Jon Sneyers

Description Logic and Rules the CHR Way
Thom Fruhwirth 

System descriptions

Compiling Constraint Handling Rules with Lazy and Concurrent Search Techniques
Martin Sulzmann, Edmund S. L. Lam    

CCHR: the fastest CHR Implementation, in C
Pieter Wuille, Tom Schrijvers, Bart Demoen

 

Programme

9:25  Welcome

9:30 Armin Wolf, Jacques Robin, Jairson Vitorino
       Adaptive CHR meets CHR^or :
       An Extended Refined Operational Semantics for CHR^or
       Based-On Justifications

10:00 Hariolf Betz
        A Linear-Logic Semantics for Constraint Handling Rules with Disjunction

10:30 - 11:00 Coffee break

11:00 Hariolf Betz
        Relating Coloured Petri Nets to Constraint,Handling Rules

11:30 Thom Fruhwirth
        Description Logic and Rules the CHR Way

12:00 Frank Raiser and Paolo Tacchella
        On Confluence of Non-terminating CHR Programs

12:30 - 14:00 Lunch break

14:00 Dean Voets, Paolo Pilozzi and  Danny De Schreye
        A new approach to termination analysis of constraint handling rules

14:30 Jon Sneyers, Peter Van Weert, Tom Schrijvers 
        Aggregates for Constraint Handling Rules

15:00 Leslie De Koninck and Jon Sneyers
        Join Ordering for Constraint Handling Rules

15:30 Pieter Wuille, Tom Schrijvers, Bart Demoen
        CCHR: the fastest CHR Implementation, in C

15:45 Martin Sulzmann, Edmund S. L. Lam
        Compiling Constraint Handling Rules with Lazy and Concurrent Search Techniques

16:00 Closing  

Important dates

  • submission deadline: June 22, 2007
  • notification of acceptance: July 12, 2007
  • final version due: August 12, 2007
  • workshop date: September 8, 2007

 

Program Committee

 

Organizing committee

Last update: 23-06-2007