{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:40:18Z","timestamp":1725518418875},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540710691"},{"type":"electronic","value":"9783540710707"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-71070-7_26","type":"book-chapter","created":{"date-parts":[[2008,8,29]],"date-time":"2008-08-29T05:56:30Z","timestamp":1219989390000},"page":"306-312","source":"Crossref","is-referenced-by-count":7,"title":["Multi-completion with Termination Tools (System Description)"],"prefix":"10.1007","author":[{"given":"Haruhiko","family":"Sato","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sarah","family":"Winkler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masahito","family":"Kurihara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aart","family":"Middeldorp","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/11814771_24","volume-title":"Automated Reasoning","author":"J. Giesl","year":"2006","unstructured":"Giesl, J., Schneider-Kamp, P., Thiemann, R.: AProVE 1.2: Automatic termination proofs in the dependency pair framework. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol.\u00a04130, pp. 281\u2013286. Springer, Heidelberg (2006)"},{"key":"26_CR2","first-page":"263","volume-title":"Computational Problems in Abstract Algebra","author":"D.E. Knuth","year":"1970","unstructured":"Knuth, D.E., Bendix, P.: Simple word problems in universal algebras. In: Leech, J. (ed.) Computational Problems in Abstract Algebra, pp. 263\u2013297. Pergamon Press, Oxford (1970)"},{"issue":"1","key":"26_CR3","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1023\/A:1006129631807","volume":"23","author":"M. Kurihara","year":"1999","unstructured":"Kurihara, M., Kondo, H.: Completion for multiple reduction orderings. Journal of Automated Reasoning\u00a023(1), 25\u201342 (1999)","journal-title":"Journal of Automated Reasoning"},{"key":"26_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/3-540-57785-8_140","volume-title":"STACS 94","author":"A. Sattler-Klein","year":"1994","unstructured":"Sattler-Klein, A.: About changing the ordering during Knuth-Bendix completion. In: Enjalbert, P., Mayr, E.W., Wagner, K.W. (eds.) STACS 1994. LNCS, vol.\u00a0775, pp. 175\u2013186. Springer, Heidelberg (1994)"},{"issue":"5","key":"26_CR5","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/j.ipl.2006.01.009","volume":"98","author":"A. Stump","year":"2006","unstructured":"Stump, A., L\u00f6chner, B.: Knuth-Bendix completion of theories of commuting group endomorphisms. Information Processing Letters\u00a098(5), 195\u2013198 (2006)","journal-title":"Information Processing Letters"},{"key":"26_CR6","doi-asserted-by":"crossref","unstructured":"Wehrman, I.: Knuth-Bendix completion with modern termination checking. Master\u2019s thesis, Washington University in St.\u00a0Louis, Technical report WUCSE-2006-45 (2006)","DOI":"10.1007\/11805618_22"},{"key":"26_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/11805618_22","volume-title":"Term Rewriting and Applications","author":"I. Wehrman","year":"2006","unstructured":"Wehrman, I., Stump, A., Westbrook, E.M.: Slothrop: Knuth-Bendix completion with a modern termination checker. In: Pfenning, F. (ed.) RTA 2006. LNCS, vol.\u00a04098, pp. 287\u2013296. Springer, Heidelberg (2006)"}],"container-title":["Lecture Notes in Computer Science","Automated Reasoning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-71070-7_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T00:15:12Z","timestamp":1605744912000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-71070-7_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540710691","9783540710707"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-71070-7_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}