POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Task granularity analysis in logic programs
PLDI '90 Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation
Compile-time derivation of variable dependency using abstract interpretation
Journal of Logic Programming
Cost analysis of logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Lower bound cost estimation for logic programs
ILPS '97 Proceedings of the 1997 international symposium on Logic programming
PPCP '94 Proceedings of the Second International Workshop on Principles and Practice of Constraint Programming
An Assertion Language for Constraint Logic Programs
Analysis and Visualization Tools for Constraint Programming, Constrain Debugging (DiSCiPl project)
Metastructures versus Attributed Variables in the Context of Extensible Unification
PLILP '92 Proceedings of the 4th International Symposium on Programming Language Implementation and Logic Programming
More Precise Yet Efficient Type Inference for Logic Programs
SAS '02 Proceedings of the 9th International Symposium on Static Analysis
A New Module System for Prolog
CL '00 Proceedings of the First International Conference on Computational Logic
On Completion of Constraint Handling Rules
CP '98 Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming
Compiling Constraint Handling Rules into Prolog with Attributed Variables
PPDP '99 Proceedings of the International Conference PPDP'99 on Principles and Practice of Declarative Programming
Approximating Constraint Logic Programs Using Polymorphic Types and Regular Descriptions
Approximating Constraint Logic Programs Using Polymorphic Types and Regular Descriptions
Science of Computer Programming - Special issue: Static analysis symposium (SAS 2003)
Proving Termination by Invariance Relations
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Constraint Handling Rules
User-definable resource bounds analysis for logic programs
ICLP'07 Proceedings of the 23rd international conference on Logic programming
Abstract critical pairs and confluence of arbitrary binary relations
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Decidability properties for fragments of chr
Theory and Practice of Logic Programming
On the Expressive Power of Multiple Heads in CHR
ACM Transactions on Computational Logic (TOCL)
A transformational approach for proving properties of the CHR constraint store
LOPSTR'09 Proceedings of the 19th international conference on Logic-Based Program Synthesis and Transformation
AProVE 1.2: automatic termination proofs in the dependency pair framework
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Diagrammatic confluence for constraint handling rules*
Theory and Practice of Logic Programming
| Hi-index | 0.00 |
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.