{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:43:31Z","timestamp":1725565411894},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540221531"},{"type":"electronic","value":"9783540259794"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-25979-4_12","type":"book-chapter","created":{"date-parts":[[2010,9,11]],"date-time":"2010-09-11T01:32:53Z","timestamp":1284168773000},"page":"170-184","source":"Crossref","is-referenced-by-count":7,"title":["Proving Properties of Term Rewrite Systems via Logic Programs"],"prefix":"10.1007","author":[{"given":"S\u00e9bastien","family":"Limet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gernot","family":"Salzer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","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":"12_CR2","unstructured":"Comon, H., Dauchet, M., Gilleron, R., Lugiez, D., Tison, S., Tommasi, M.: Tree Automata Techniques and Applications (TATA)(1997), http:\/\/www.grappa.univ-lille3.fr\/tata"},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/S0304-3975(96)00333-7","volume":"194","author":"P. Gyenizse","year":"1998","unstructured":"Gyenizse, P., V\u00e1gv\u00f6lgyi, S.: Linear generalized semi-monadic rewrite systems effectively preserve recognizability. Theoretical Computer Science\u00a0194, 87\u2013122 (1998)","journal-title":"Theoretical Computer Science"},{"key":"12_CR4","doi-asserted-by":"crossref","first-page":"69","DOI":"10.46298\/dmtcs.240","volume":"1","author":"S. Limet","year":"1997","unstructured":"Limet, S., R\u00e9ty, P.: E-unification by means of tree tuple synchronized grammars. Discrete Mathematics and Theoretical Computer Science\u00a01, 69\u201398 (1997)","journal-title":"Discrete Mathematics and Theoretical Computer Science"},{"key":"12_CR5","volume-title":"Electronic Notes in Theoretical Computer Science","author":"S. Limet","year":"2003","unstructured":"Limet, S., Salzer, G.: Manipulating tree tuple languages by transforming logic programs. In: Dahn, I., Vigneron, L. (eds.) Electronic Notes in Theoretical Computer Science, vol.\u00a086, Elsevier, Amsterdam (2003)"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Limet, S., Salzer, G.: Proving properties of term rewrite systems via logic programs. Technical report, RR-2004-5, LIFO Universit\u00e9 d\u2019Orl\u00e9ans (2004), www.univorleans.fr\/SCIENCES\/LIFO\/prodsci\/publications\/lifo2004.htm.en","DOI":"10.1007\/978-3-540-25979-4_12"},{"key":"12_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-96826-6","volume-title":"Foundations of Logic Programming","author":"J.W. Lloyd","year":"1984","unstructured":"Lloyd, J.W.: Foundations of Logic Programming. Springer, Heidelberg (1984)"},{"issue":"1-2","key":"12_CR8","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/S0304-3975(00)00306-6","volume":"274","author":"D. Lugiez","year":"2002","unstructured":"Lugiez, D., Schnoebelen, P.: The regular viewpoint on pa-processes. Theoretical Computer Science\u00a0274(1-2), 89\u2013115 (2002)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"12_CR9","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/0304-3975(94)00227-A","volume":"142","author":"M. Proietti","year":"1995","unstructured":"Proietti, M., Pettorossi, A.: Unfolding-definition-folding, in this order, for avoiding unnecessary variables in logic programs. Theoretical Computer Science\u00a0142(1), 89\u2013124 (1995)","journal-title":"Theoretical Computer Science"},{"key":"12_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48242-3_10","volume-title":"Logic Programming and Automated Reasoning","author":"P. R\u00e9ty","year":"1999","unstructured":"R\u00e9ty, P.: Regular sets of descendants for constructor-based rewrite systems. In: Ganzinger, H., McAllester, D., Voronkov, A. (eds.) LPAR 1999. LNCS, vol.\u00a01705, Springer, Heidelberg (1999)"},{"key":"12_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/3-540-45610-4_8","volume-title":"Rewriting Techniques and Applications","author":"H. Seki","year":"2002","unstructured":"Seki, H., Takai, T., Fujinaka, Y., Kaji, Y.: Layered transducing term rewriting system and its recognizability preserving property. In: Tison, S. (ed.) RTA 2002. LNCS, vol.\u00a02378, p. 98. Springer, Heidelberg (2002)"},{"key":"12_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/10721975_17","volume-title":"Rewriting Techniques and Applications","author":"T. Takai","year":"2000","unstructured":"Takai, T., Kaji, Y., Seki, H.: Right-linear finite path overlapping term rewriting systems effectively preserve recognizability. In: Bachmair, L. (ed.) RTA 2000. LNCS, vol.\u00a01833, pp. 270\u2013273. Springer, Heidelberg (2000)"},{"key":"12_CR13","unstructured":"Tamaki, H., Sato, T.: Unfold\/fold transformation of logic programs. In: T\u00e4rnlund, S. (ed.) Proc. 2nd Int. Logic Programming Conf (ICLP), University of Uppsala, Sweden, pp. 127\u2013138 (1984)"}],"container-title":["Lecture Notes in Computer Science","Rewriting Techniques and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-25979-4_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,9]],"date-time":"2021-11-09T14:44:47Z","timestamp":1636469087000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-25979-4_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540221531","9783540259794"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-25979-4_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}