{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:58:38Z","timestamp":1725663518969},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540563938"},{"type":"electronic","value":"9783540475491"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-56393-8_37","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:08:25Z","timestamp":1330254505000},"page":"458-467","source":"Crossref","is-referenced-by-count":1,"title":["A strategy to deal with divergent rewrite systems"],"prefix":"10.1007","author":[{"given":"Paola","family":"Inverardi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Monica","family":"Nesi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"37_CR1","doi-asserted-by":"crossref","unstructured":"Avenhaus J., \u2018Proving Equational and Inductive Theorems by Completion and Embedding Techniques', in Proceedings of Rewriting Techniques and Applications, Lecture Notes in Computer Science, Springer-Vorlag, 1991, Vol. 488, pp. 361\u2013373.","DOI":"10.1007\/3-540-53904-2_110"},{"key":"37_CR2","first-page":"100","volume-title":"Lecture Notes in Computer Science","author":"H. Chen","year":"1991","unstructured":"Chen H., Hsiang J., Kong H. \u2018On Finite Representations of Infinite Sequences of Terms', in Proceedings of the 2nd International Workshop on Conditional and Typed Rewriting Systems, Montreal, 1990, Lecture Notes in Computer Science, Springer-Verlag, 1991, Vol. 516, pp. 100\u2013114."},{"key":"37_CR3","doi-asserted-by":"crossref","unstructured":"Dershowitz N., Jouannaud J.-P., \u2018Rewrite Systems', in Handbook of Theoretical Computer Science, Vol. B: Formal Models and Semantics, J. van Leeuwen (ed.), North-Holland, 1990, pp. 243\u2013320.","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"key":"37_CR4","doi-asserted-by":"crossref","unstructured":"Gloess P.Y., Laurent J.-P. II., \u2018Adding Dynamic Paramodulation to Rewrite Algorithms', in Proceedings of the 5th Conference on Automated Deduction, Lecture Notes in Computer Science, Springer-Verlag, 1980, Vol. S7, pp. 195\u2013207.","DOI":"10.1007\/3-540-10009-1_16"},{"key":"37_CR5","unstructured":"Hermann M., \u2018Vademecum of Divergent Term Rewriting Systems', Technical Report CRIN 88-R-082, Centre de Recherche en Informatique de Nancy, 1988."},{"key":"37_CR6","unstructured":"Hermann M., \u2018Crossed Term Rewriting Systems', Technical Report CRIN 89-R-003, Centre de Recherche en Informatique de Nancy, 1989."},{"key":"37_CR7","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/BF01888225","volume":"2","author":"M. Hermann","year":"1990","unstructured":"Hermann M., \u2018Chain Properties of Rule Closures', Formal Aspects of Computing, 1990, Vol. 2, pp. 207\u2013225.","journal-title":"Formal Aspects of Computing"},{"key":"37_CR8","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0020-0190(90)90023-Q","volume":"35","author":"P. Inverardi","year":"1990","unstructured":"Inverardi P., Nesi M., \u2018A Rewriting Strategy to Verify Observational Congruence', Information Processing Letters, 1990. Vol. 35, pp. 191\u2013199.","journal-title":"Information Processing Letters"},{"key":"37_CR9","series-title":"Workshop Series","volume-title":"On Rewriting Behavioural Semantics in Process Algebras","author":"P. Inverardi","year":"1991","unstructured":"Inverardi P., Nesi M., \u2018On Rewriting Behavioural Semantics in Process Algebras', in Proceedings of the 2nd International Conference on Algebraic Methodology and Software Technology AMAST '91, Iowa City, USA, 1991, (to appear in Workshop Series, Springer-Verlag)."},{"key":"37_CR10","volume-title":"Technical Report B4-06","author":"P. Inverardi","year":"1992","unstructured":"Inverardi P., Nesi M., \u2018On Dealing with Divergent Rewrite Systems', Technical Report B4-06, I.E.I.-C.N.R., Pisa, Italy, March 1992."},{"key":"37_CR11","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/0304-3975(89)90007-8","volume":"67","author":"H. Kirchner","year":"1989","unstructured":"Kirchner H., \u2018Schematization of infinite sets of rewrite rules generated by divergent completion processes', in Theoretical Computer Science, North-Holland, 1989, Vol. 67, pp. 303\u2013332.","journal-title":"Theoretical Computer Science"},{"key":"37_CR12","first-page":"143","volume-title":"Lecture Notes in Computer Science","author":"H. Kirchner","year":"1991","unstructured":"Kirchner H., Hermann M., \u2018Meta-rule Synthesis from Crossed Rewrite Systems', in Proceedings of the 2nd International Workshop on Conditional and Typed Rewriting Systems, Montreal, 1990, Lecture Notes in Computer Science, Springer-Verlag, 1991, Vol. 516, pp. 143\u2013154."},{"key":"37_CR13","unstructured":"Knuth D., Bendix P., 'simple word problems in universal algebra', Computational Problems in Abstract Algebra, J. Leech (ed.), Pergamon Press, 1970."},{"key":"37_CR14","doi-asserted-by":"crossref","unstructured":"Lange S., \u2018Towards a Set of Inference Rules for Solving Divergence in Knuth-Bendix Completion', in Proceedings of Analogical and Inductive Inference, K.P. Jantke (ed.), Lecture Notes in Computer Science, Springer-Verlag, 1989, Vol. 397, pp. 304\u2013316.","DOI":"10.1007\/3-540-51734-0_70"},{"key":"37_CR15","unstructured":"Lysne O., \u2018Term Rewriting Techniques for Systems based on Generator Induction', Research Report No. 163, Department of Informatics, University of Oslo, December 1991."},{"key":"37_CR16","unstructured":"Milner R., Communication and Concurrency, Prentice Hall, 1989."},{"key":"37_CR17","doi-asserted-by":"crossref","unstructured":"Sattler-Klein A., \u2018Divergence phenomena during completion', in Proceedings of Rewriting Techniques and Applications, Lecture Notes in Computer Science, Springer-Verlag, 1991, Vol. 488, pp. 374\u2013385.","DOI":"10.1007\/3-540-53904-2_111"},{"key":"37_CR18","doi-asserted-by":"crossref","unstructured":"Thomas M., Jantke K. P., \u2018Inductive Inference for Solving Divergence in Knuth-Bendix Completion', in Proceedings of Analogical and Inductive Inference, K.P. Jantke (ed.), Lecture Notes in Computer Science, Springer-Verlag, 1989, Vol. 397, pp. 288\u2013303.","DOI":"10.1007\/3-540-51734-0_69"},{"key":"37_CR19","series-title":"Workshop Series","volume-title":"Theoretical Computer Science, abstract in Proceedings of the 2nd International Conference on Algebraic Methodology and Software Technology AMAST '91","author":"M. Thomas","year":"1991","unstructured":"Thomas M., Watson P., \u2018Solving Divergence in Knuth-Bendix Completion by Enriching Signatures', submitted to Theoretical Computer Science, abstract in Proceedings of the 2nd International Conference on Algebraic Methodology and Software Technology AMAST '91, Iowa City, USA, 1991, (to appeal-in Workshop Series, Springer-Verlag)."}],"container-title":["Lecture Notes in Computer Science","Conditional Term Rewriting Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56393-8_37.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T00:50:26Z","timestamp":1619571026000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56393-8_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540563938","9783540475491"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-56393-8_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}