Abstract
A fundamental question in programming language semantics is when two programs should be considered equivalent. In this paper we introduce a notion of operational equivalence for CHR programs and user-defined constraints. Constraint Handling Rules (CHR) is a high-level language for writing constraint solvers either from scratch or by modifying existing solvers.
We give a decidable, sufficient and necessary syntactic condition for operational equivalence of terminating and confluent CHR programs.
For practical reasons, we also investigate a notion of operational equivalence for user-defined constraints that are defined in different programs. We give a sufficient syntactic condition for constraints defined in terminating and confluent CHR programs. For a subclass of programs which have only one user-defined constraint in common, we are able to give a sufficient and necessary syntactic condition.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abdennadher, S.: Operational semantics and conuence of constraint propagation rules. In: Smolka, G. (ed.) CP 1997. LNCS, vol. 1330. Springer, Heidelberg (1997)
ACM. The constraint programming working group. Technical report, ACMMIT SDRC Workshop, Report Outline (1996)
Abdennadher, S., Frühwirth, T.: On completion of constraint handling rules. In: Maher, M.J., Puget, J.-F. (eds.) CP 1998. LNCS, vol. 1520, p. 25. Springer, Heidelberg (1998)
Abdennadher, S., Frühwirth, T.: Operational equivalence of constraint handling rules. Research report PMS-FB-1999-4, Computer Science Department, University of Munich (1999)
Abdennadher, S., Frühwirth, T., Meuss, H.: On conuence of constraint handling rules. In: Freuder, E.C. (ed.) CP 1996. LNCS, vol. 1118. Springer, Heidelberg (1996)
Abdennadher, S., Frühwirth, T., Meuss, H.: Conuence and semantics of constraint simplification rules. Constraints Journal, Special Issue on the Second International Conference on Principles and Practice of Constraint Programming 4(2) (May 1999)
Etalle, S., Gabrielli, M., Meo, M.: Unfold/fold transformations of CCP programs. In: 9th International Conference on Concurrency Theory (1998) (Corrected version)
Frühwirth, T.: Theory and practice of constraint handling rules, special issue on constraint logic programming. Journal of Logic Programming, 95–138 (October 1998)
Gabbrielli, M., Levi, G., Chiara Meo, M.: Observable behaviors and equivalences of logic programs. Information and Computation 122(1), 1–29 (1995)
Maher, M.J.: Equivalences of logic programs. In: Proceedings of Third Inter-national Conference on Logic Programming. Springer, Berlin (1986)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Abdennadher, S., Frühwirth, T. (1999). Operational Equivalence of CHR Programs and Constraints. In: Jaffar, J. (eds) Principles and Practice of Constraint Programming – CP’99. CP 1999. Lecture Notes in Computer Science, vol 1713. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-48085-3_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-48085-3_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66626-4
Online ISBN: 978-3-540-48085-3
eBook Packages: Springer Book Archive