{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:13:03Z","timestamp":1725577983875},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540356318"},{"type":"electronic","value":"9783540356325"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11783596_24","type":"book-chapter","created":{"date-parts":[[2006,6,28]],"date-time":"2006-06-28T14:35:02Z","timestamp":1151505302000},"page":"416-432","source":"Crossref","is-referenced-by-count":0,"title":["Constructing Rewrite-Based Decision Procedures for Embeddings and Termination"],"prefix":"10.1007","author":[{"given":"Georg","family":"Struth","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/11734673_18","volume-title":"Relational Methods in Computer Science","author":"G. Struth","year":"2006","unstructured":"Struth, G.: Knuth-bendix completion as a data structure. In: MacCaull, W., Winter, M., D\u00fcntsch, I. (eds.) RelMiCS 2005. LNCS, vol.\u00a03929, pp. 225\u2013236. Springer, Heidelberg (2006)"},{"key":"24_CR2","series-title":"Electron. Notes in Theor. Comput. Sci","volume-title":"Proc. of 2nd Int. Wksh. on Rule-Based Programming, RULE 2001","author":"G. Struth","year":"2001","unstructured":"Struth, G.: Knuth-Bendix completion for non-symmetric transitive relations. In: van den Brand, M., Verma, R. (eds.) Proc. of 2nd Int. Wksh. on Rule-Based Programming, RULE 2001. Electron. Notes in Theor. Comput. Sci., vol.\u00a059. Elsevier, Amsterdam (2001)"},{"key":"24_CR3","unstructured":"Struth, G.: Canonical Transformations in Algebra, Universal Algebra and Logic. PhD thesis. Inst. f\u00fcr Informatik, Univ. des Saarlandes (1998)"},{"key":"24_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1007\/3-540-56868-9_30","volume-title":"Rewriting Techniques and Applications","author":"D.A. Plaisted","year":"1993","unstructured":"Plaisted, D.A.: Polynomial termination and constraint satisfaction tests. In: Kirchner, C. (ed.) RTA 1993. LNCS, vol.\u00a0690, pp. 405\u2013420. Springer, Heidelberg (1993)"},{"key":"24_CR5","unstructured":"Kozen, D.: Complexity of finitely presented algebras. Techn. Report TR-76-294, Dept. of Computer Science, Cornell Univ. (1979)"},{"key":"24_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1007\/3-540-51081-8_123","volume-title":"Rewriting Techniques and Applications","author":"W. Snyder","year":"1989","unstructured":"Snyder, W.: Efficient ground completion: an O(n\u00a0log\u00a0n) algorithm for generating reduced sets of ground rewrite rules equivalent to a set of ground equations E. In: Dershowitz, N. (ed.) RTA 1989. LNCS, vol.\u00a0355, pp. 419\u2013433. Springer, Heidelberg (1989)"},{"key":"24_CR7","unstructured":"Nelson, G.: Techniques for program verification. Techn. Report CSL-81-10, Xerox Palo Alto Research Center (1981)"},{"key":"24_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/3-540-62950-5_59","volume-title":"Rewriting Techniques and Applications","author":"D. Kapur","year":"1997","unstructured":"Kapur, D.: Shostak\u2019s congruence closure as completion. In: Comon, H. (ed.) RTA 1997. LNCS, vol.\u00a01232, pp. 23\u201337. Springer, Heidelberg (1997)"},{"key":"24_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/10721975_15","volume-title":"Rewriting Techniques and Applications","author":"G. Struth","year":"2000","unstructured":"Struth, G.: An algebra of resolution. In: Bachmair, L. (ed.) RTA 2000. LNCS, vol.\u00a01833, pp. 214\u2013228. Springer, Heidelberg (2000)"},{"key":"24_CR10","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139172752","volume-title":"Term Rewriting and All That","author":"F. Baader","year":"1998","unstructured":"Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)"},{"key":"24_CR11","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1006\/jsco.1996.0053","volume":"22","author":"J. Levy","year":"1996","unstructured":"Levy, J., Agust\u00ed, J.: Bi-rewrite systems. J. of Symb. Comput.\u00a022, 279\u2013314 (1996)","journal-title":"J. of Symb. Comput."},{"key":"24_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-76771-5","volume-title":"Universal Algebra for Computer Scientists","author":"W. Wechler","year":"1992","unstructured":"Wechler, W.: Universal Algebra for Computer Scientists. Springer, Heidelberg (1992)"},{"key":"24_CR13","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/S0747-7171(87)80022-6","volume":"3","author":"N. Dershowitz","year":"1987","unstructured":"Dershowitz, N.: Termination of rewriting. J. of Symb. Comput.\u00a03, 69\u2013116 (1987)","journal-title":"J. of Symb. Comput."},{"key":"24_CR14","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0020-0190(85)90063-8","volume":"20","author":"D.A. Plaisted","year":"1985","unstructured":"Plaisted, D.A.: The undecidability of self-embedding for term rewriting systems. Inform. Proc. Lett.\u00a020, 61\u201364 (1985)","journal-title":"Inform. Proc. Lett."},{"key":"24_CR15","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/0743-1066(93)90022-9","volume":"16","author":"R. Bol","year":"1993","unstructured":"Bol, R.: Loop checking in partial deduction. J. of Logic Programming\u00a016, 25\u201346 (1993)","journal-title":"J. of Logic Programming"},{"key":"24_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/3-540-49727-7_14","volume-title":"Static Analysis","author":"M.A. Leuschel","year":"1998","unstructured":"Leuschel, M.A.: On the power of homeomorphic embedding for online termination. In: Levi, G. (ed.) SAS 1998. LNCS, vol.\u00a01503, pp. 230\u2013245. Springer, Heidelberg (1998)"},{"key":"24_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/3-540-61580-6_8","volume-title":"Partial Evaluation","author":"R. Gl\u00fcck","year":"1996","unstructured":"Gl\u00fcck, R., S\u00f8rensen, M.H.: A roadmap to metacomputation by supercompilation. In: Danvy, O., Thiemann, P., Gl\u00fcck, R. (eds.) Dagstuhl Seminar 1996. LNCS, vol.\u00a01110, pp. 137\u2013160. Springer, Heidelberg (1996)"}],"container-title":["Lecture Notes in Computer Science","Mathematics of Program Construction"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11783596_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:07:53Z","timestamp":1605643673000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11783596_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540356318","9783540356325"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11783596_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}