{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:14:15Z","timestamp":1726409655158},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540734475"},{"type":"electronic","value":"9783540734499"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73449-9_17","type":"book-chapter","created":{"date-parts":[[2007,8,13]],"date-time":"2007-08-13T12:49:53Z","timestamp":1187009393000},"page":"214-228","source":"Crossref","is-referenced-by-count":0,"title":["Abstract Critical Pairs and Confluence of Arbitrary Binary Relations"],"prefix":"10.1007","author":[{"given":"R\u00e9my","family":"Haemmerl\u00e9","sequence":"first","affiliation":[]},{"given":"Fran\u00e7ois","family":"Fages","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1007\/BFb0017444","volume-title":"Principles and Practice of Constraint Programming - CP 1997","author":"S. Abdennadher","year":"1997","unstructured":"Abdennadher, S.: Operational semantics and confluence of constraint propagation rules. In: Smolka, G. (ed.) Principles and Practice of Constraint Programming - CP 1997. LNCS, vol.\u00a01330, pp. 252\u2013266. Springer, Heidelberg (1997)"},{"key":"17_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/10721975_4","volume-title":"Rewriting Techniques and Applications","author":"F. Blanqui","year":"2000","unstructured":"Blanqui, F.: Termination and confluence of higher-order rewrite systems. In: Bachmair, L. (ed.) RTA 2000. LNCS, vol.\u00a01833, pp. 47\u201361. Springer, Heidelberg (2000)"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Bonacia, M., Dershowitz, N.: Abstract canonical inference. ACM Transactions on Computational Logic, 8(1) (2007)","DOI":"10.1145\/1182613.1182619"},{"key":"17_CR4","unstructured":"Clavel, M., Dur\u00e1n, 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)"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"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\u2013260 (1991)","DOI":"10.1007\/BFb0013469"},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.tcs.2006.03.012","volume":"357","author":"N. Dershowitz","year":"2006","unstructured":"Dershowitz, N., Kirchner, C.: Abstract canonical presentations. Journal of Theorical Computer Science\u00a0357, 53\u201369 (2006)","journal-title":"Journal of Theorical Computer Science"},{"key":"17_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/3-540-19242-5_3","volume-title":"Proceedings of the First International Workshop on Conditional Term Rewriting Systems","author":"N. Dershowitz","year":"1988","unstructured":"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.\u00a0308, pp. 31\u201344. Springer, Heidelberg (1988)"},{"issue":"1-3","key":"17_CR8","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/S0743-1066(98)10005-5","volume":"37","author":"T. Fr\u00fchwirth","year":"1998","unstructured":"Fr\u00fchwirth, T.: Theory and practice of constraint handling rules. Journal of Logic Programming, Special Issue on Constraint Logic Programming\u00a037(1-3), 95\u2013138 (1998)","journal-title":"Journal of Logic Programming, Special Issue on Constraint Logic Programming"},{"issue":"4","key":"17_CR9","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1145\/322217.322230","volume":"27","author":"G. Huet","year":"1980","unstructured":"Huet, G.: Confluent reductions: Abstract properties and applications to term rewriting systems: Abstract properties and applications to term rewriting systems. Journal of the ACM\u00a027(4), 797\u2013821 (1980)","journal-title":"Journal of the ACM"},{"issue":"4","key":"17_CR10","doi-asserted-by":"publisher","first-page":"1155","DOI":"10.1137\/0215084","volume":"15","author":"J.-P. Jouannaud","year":"1986","unstructured":"Jouannaud, J.-P., Kirchner, H.: Completion of a set of rules modulo a set of equations. SIAM Journal of Computing\u00a015(4), 1155\u20131194 (1986)","journal-title":"SIAM Journal of Computing"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Leifer, J.J., Milner, R.: Deriving bisimulation congruences for reactive systems. In: Proceedings of the 11th International Conference on Concurrency Theory, pp. 243\u2013258 (2000)","DOI":"10.1007\/3-540-44618-4_19"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"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\u2013372 (1996)","DOI":"10.1007\/3-540-61604-7_64"},{"key":"17_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1007\/3-540-48320-9_33","volume-title":"CONCUR 1999. Concurrency Theory","author":"T. Noll","year":"1999","unstructured":"Noll, T.: On coherence properties in term rewriting models of concurrency. In: Baeten, J.C.M., Mauw, S. (eds.) CONCUR 1999. LNCS, vol.\u00a01664, pp. 478\u2013493. Springer, Heidelberg (1999)"},{"issue":"2","key":"17_CR14","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1145\/322248.322251","volume":"28","author":"G. Peterson","year":"1981","unstructured":"Peterson, G., Stickel, M.: Complete sets of reductions for some equational theories. Journal of the ACM\u00a028(2), 233\u2013264 (1981)","journal-title":"Journal of the ACM"},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"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\u2013325 (1993)","DOI":"10.1007\/3-540-57787-4_20"},{"key":"17_CR16","series-title":"Cambridge Tracts in Theoretical Computer Science","volume-title":"Term Rewriting Systems","author":"Terese","year":"2003","unstructured":"Terese.: Term Rewriting Systems. Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, Cambridge (2003)"}],"container-title":["Lecture Notes in Computer Science","Term Rewriting and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73449-9_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,13]],"date-time":"2023-05-13T15:36:51Z","timestamp":1683992211000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73449-9_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540734475","9783540734499"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73449-9_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}