{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T21:18:57Z","timestamp":1725830337906},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319242453"},{"type":"electronic","value":"9783319242460"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-24246-0_13","type":"book-chapter","created":{"date-parts":[[2015,9,19]],"date-time":"2015-09-19T04:20:53Z","timestamp":1442636453000},"page":"205-219","source":"Crossref","is-referenced-by-count":1,"title":["A Completion Method to Decide Reachability in Rewrite Systems"],"prefix":"10.1007","author":[{"given":"Guillaume","family":"Burel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gilles","family":"Dowek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ying","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,11,12]]},"reference":[{"key":"13_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/3-540-63141-0_10","volume-title":"CONCUR\u201997: Concurrency Theory","author":"A. Bouajjani","year":"1997","unstructured":"Bouajjani, A., Esparza, J., Maler, O.: Reachability analysis of pushdown automata: Application to model-checking. In: Mazurkiewicz, A., Winkowski, J. (eds.) CONCUR 1997. LNCS, vol.\u00a01243, pp. 135\u2013150. Springer, Heidelberg (1997)"},{"key":"13_CR2","unstructured":"Burel, G., Dowek, G., Jiang, Y.: Automata, resolution and cut-elimination (manuscript) (2015)"},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/BFb0028794","volume-title":"Fundamentals of Computation Theory","author":"M. Dauchet","year":"1985","unstructured":"Dauchet, M., Tison, S.: Decidability of confluence for ground term rewriting systems. In: Budach, L. (ed.) FCT 1985. LNCS, vol.\u00a0199, pp. 80\u201389. Springer, Heidelberg (1985)"},{"key":"13_CR4","unstructured":"Dershowitz, N.: Completion and its applications. In: A\u00eft-Kaci, H., Nivat, M. (eds.) Resolution of Equations in Algebraic Structures, vol.\u00a02, chapter 2, pp. 31\u201386. Academic Press (1989)"},{"issue":"8","key":"13_CR5","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1145\/359138.359142","volume":"22","author":"N. Dershowitz","year":"1979","unstructured":"Dershowitz, N., Manna, Z.: Proving termination with multiset orderings. Communications of the ACM\u00a022(8), 465\u2013476 (1979)","journal-title":"Communications of the ACM"},{"key":"13_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/3-540-45841-7_3","volume-title":"STACS 2002","author":"G. Dowek","year":"2002","unstructured":"Dowek, G.: What is a theory? In: Alt, H., Ferreira, A. (eds.) STACS 2002. LNCS, vol.\u00a02285, pp. 50\u201364. Springer, Heidelberg (2002)"},{"key":"13_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/3-540-44881-0_2","volume-title":"Rewriting Techniques and Applications","author":"G. Dowek","year":"2003","unstructured":"Dowek, G.: Confluence as a cut elimination property. In: Nieuwenhuis, R. (ed.) RTA 2003. LNCS, vol.\u00a02706, pp. 2\u201313. Springer, Heidelberg (2003)"},{"key":"13_CR8","series-title":"IFIP AICT","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/978-3-642-15240-5_14","volume-title":"Theoretical Computer Science","author":"G. Dowek","year":"2010","unstructured":"Dowek, G.: Polarized resolution modulo. In: Calude, C.S., Sassone, V. (eds.) TCS 2010. IFIP AICT, vol.\u00a0323, pp. 182\u2013196. Springer, Heidelberg (2010)"},{"key":"13_CR9","unstructured":"Hirokawa, N.: Commutation and signature extension. In: Tiwari, A., Aoto, T. (eds.) International Workshop on Confluence (2015)"},{"issue":"4","key":"13_CR10","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. Journal of the Association of Computing Machinery\u00a027(4), 797\u2013821 (1980)","journal-title":"Journal of the Association of Computing Machinery"},{"issue":"4","key":"13_CR11","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":"13_CR12","unstructured":"Kamin, S., L\u00e9vy, J.-J.: Attempts for generalizing the recursive path ordering (unpublished manuscript)"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Knuth, D., Bendix, P.: Simple word problems in universal algebras. In: Computational Problems in Abstract Algebra, pp. 263\u2013297, Pergamon (1970)","DOI":"10.1016\/B978-0-08-012975-4.50028-X"},{"key":"13_CR14","unstructured":"Lankford, D.S.: Canonical inference. Technical report, Louisiana Tech. University (1975)"}],"container-title":["Lecture Notes in Computer Science","Frontiers of Combining Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-24246-0_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:42:42Z","timestamp":1559263362000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-24246-0_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319242453","9783319242460"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-24246-0_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}