Abstract
In a seminal paper, Huet introduced abstract properties of term rewriting systems, and the confluence analysis of terminating term rewriting systems by critical pairs computation. In this paper, we provide an abstract notion of critical pair for arbitrary binary relations and context operators. We show how this notion applies to the confluence analysis of various transition systems, ranging from classical term rewriting systems to production rules with constraints and partial control strategies, such as the Constraint Handling Rules language CHR. Interestingly, we show in all these cases that some classical critical pairs can be disregarded. The crux of these analyses is the ability to compute critical pairs between states built with general context operators, on which a bounded, not necessarily well-founded, ordering is assumed.
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 confluence of constraint propagation rules. In: Smolka, G. (ed.) Principles and Practice of Constraint Programming - CP 1997. LNCS, vol. 1330, pp. 252–266. Springer, Heidelberg (1997)
Blanqui, F.: Termination and confluence of higher-order rewrite systems. In: Bachmair, L. (ed.) RTA 2000. LNCS, vol. 1833, pp. 47–61. Springer, Heidelberg (2000)
Bonacia, M., Dershowitz, N.: Abstract canonical inference. ACM Transactions on Computational Logic, 8(1) (2007)
Clavel, M., Durán, F., Eker, S., Meseguer, J.: Building equational proving tools by reflection in rewriting logic. In: Proceedings of the CafeOBJ Symposium 1998. Japan Advanced Institute for Science and Technology (1998)
Corradini, A., Montanari, U.: An algebra of graphs and graph rewriting. In: Proceedings of the 4th International Conference on Category Theory and Computer Science, Lecture Notes in Computer Science, pp. 236–260 (1991)
Dershowitz, N., Kirchner, C.: Abstract canonical presentations. Journal of Theorical Computer Science 357, 53–69 (2006)
Dershowitz, N., Okada, M., Sivakumar, G.: Confluence of conditional rewrite systems. In: Kaplan, S., Jouannaud, J.-P. (eds.) Proceedings of the First International Workshop on Conditional Term Rewriting Systems. LNCS, vol. 308, pp. 31–44. Springer, Heidelberg (1988)
Frühwirth, T.: Theory and practice of constraint handling rules. Journal of Logic Programming, Special Issue on Constraint Logic Programming 37(1-3), 95–138 (1998)
Huet, G.: Confluent reductions: Abstract properties and applications to term rewriting systems: Abstract properties and applications to term rewriting systems. Journal of the ACM 27(4), 797–821 (1980)
Jouannaud, J.-P., Kirchner, H.: Completion of a set of rules modulo a set of equations. SIAM Journal of Computing 15(4), 1155–1194 (1986)
Leifer, J.J., Milner, R.: Deriving bisimulation congruences for reactive systems. In: Proceedings of the 11th International Conference on Concurrency Theory, pp. 243–258 (2000)
Meseguer, J.: Rewriting logic as a semantic framework for concurrency: a progress report. In: Proceedings of the 7th International Conference on Concurrency Theory, pp. 331–372 (1996)
Noll, T.: On coherence properties in term rewriting models of concurrency. In: Baeten, J.C.M., Mauw, S. (eds.) CONCUR 1999. LNCS, vol. 1664, pp. 478–493. Springer, Heidelberg (1999)
Peterson, G., Stickel, M.: Complete sets of reductions for some equational theories. Journal of the ACM 28(2), 233–264 (1981)
Raoult, J., Voisin, F.: Set-theoretic graph rewriting. In: Proceedings of the International Workshop on Graph Transformations in Computer Science, Lecture Notes in Computer Science, pp. 312–325 (1993)
Terese.: Term Rewriting Systems. Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, Cambridge (2003)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Haemmerlé, R., Fages, F. (2007). Abstract Critical Pairs and Confluence of Arbitrary Binary Relations. In: Baader, F. (eds) Term Rewriting and Applications. RTA 2007. Lecture Notes in Computer Science, vol 4533. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73449-9_17
Download citation
DOI: https://doi.org/10.1007/978-3-540-73449-9_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73447-5
Online ISBN: 978-3-540-73449-9
eBook Packages: Computer ScienceComputer Science (R0)