Memorias de investigación
Communications at congresses:
CLP Projection for Constraint Handling Rules
Year:2011

Research Areas
  • Programming language

Information
Abstract
This paper introduces and studies the notion of CLP projection for Constraint Handling Rules (CHR). The CLP projection consists of a naive translation of CHR programs into Constraint Logic Programs (CLP). We show that the CLP projection provides a safe operational and declarative approximation for CHR programs. We demonstrate moreover that a confluent CHR program has a least model, which is precisely equal to the least model of its CLP projection (closing hence a ten year-old conjecture by Abdennadher et al.). Finally, we illustrate how the notion of CLP projection can be used in practice to apply CLP analyzers to CHR. In particular, we show results from applying AProVE to prove termination, and CiaoPP to infer both complexity upper bounds and types for CHR programs.
International
Si
Congress
International Conference on Principles and Practice of Declarative Programming
960
Place
Odense, Dinamarca
Reviewers
Si
ISBN/ISSN
978-1-4503-0776-5
Start Date
20/07/2011
End Date
22/07/2011
From page
137
To page
148
Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming
Participants

Research Group, Departaments and Institutes related
  • Creador: Grupo de Investigación: Computación lógica, Lenguajes, Implementación y Paralelismo (CLIP)
  • Departamento: Inteligencia Artificial