CHR 2012 - Ninth International Workshop on Constraint Handling Rules
Topics/Call fo Papers
The CHR 2012 Workshop will be held on September 4th, 2012 in Budapest (Hungary) at the occasion of ICLP 2012, the premier international venue for presenting research in logic programming.
The Constraint Handling Rules (CHR) language has become a major declarative specification formalism 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 for more information.
The aim of the CHR workshop series is to stimulate and promote international research and collaboration on topics related to the Constraint Handling Rules language. The workshop is a lively, friendly forum for presenting and discussing new results, interesting applications, and work in progress. Previous Workshops on Constraint Handling Rules were organized in 2004 in Ulm (Germany), in 2005 in Sitges (Spain) at ICLP, in 2006 in Venice (Italy) at ICALP, in 2007 in Porto (Portugal) at ICLP, in 2008 in Hagenberg (Austria) at RTA, in 2009 in Pasadena (California, US) at ICLP, in 2010 in Edinburgh (Scotland, UK) at ICLP, and in 2011 in Cairo (Egypt), at the 2nd CHR summer school.
Topics of Interest
The workshop calls for full papers and short papers describing ongoing work on any aspect of CHR and related approaches. The following topics are relevant (this list is non-exhaustive):
(Logical) Algorithms
Applications
Comparisons with Related Approaches
Constraint Solvers
Critical Assessment
Expressiveness and Complexity
Implementations and Optimization
Language Extensions (Types, Modules,...)
Program Analysis
Program Transformation and Generation
Programming Environments (Debugging)
Programming Pearls
Programming Tools
Retractable Constraints
Semantics
System Descriptions
The Constraint Handling Rules (CHR) language has become a major declarative specification formalism 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 for more information.
The aim of the CHR workshop series is to stimulate and promote international research and collaboration on topics related to the Constraint Handling Rules language. The workshop is a lively, friendly forum for presenting and discussing new results, interesting applications, and work in progress. Previous Workshops on Constraint Handling Rules were organized in 2004 in Ulm (Germany), in 2005 in Sitges (Spain) at ICLP, in 2006 in Venice (Italy) at ICALP, in 2007 in Porto (Portugal) at ICLP, in 2008 in Hagenberg (Austria) at RTA, in 2009 in Pasadena (California, US) at ICLP, in 2010 in Edinburgh (Scotland, UK) at ICLP, and in 2011 in Cairo (Egypt), at the 2nd CHR summer school.
Topics of Interest
The workshop calls for full papers and short papers describing ongoing work on any aspect of CHR and related approaches. The following topics are relevant (this list is non-exhaustive):
(Logical) Algorithms
Applications
Comparisons with Related Approaches
Constraint Solvers
Critical Assessment
Expressiveness and Complexity
Implementations and Optimization
Language Extensions (Types, Modules,...)
Program Analysis
Program Transformation and Generation
Programming Environments (Debugging)
Programming Pearls
Programming Tools
Retractable Constraints
Semantics
System Descriptions
Other CFPs
- International Workshop on Coinductive Logic Programming (Co-LP)
- 5th Workshop on Answer Set Programming and Other Computing Paradigms
- The 5th International Conference on Amazigh and Information and Communication Technologies
- International Cooperative Research Conference
- 13th Italian Conference on Theoretical Computer Science
Last modified: 2012-05-05 10:38:09