{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:19:57Z","timestamp":1725664797712},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540614647"},{"type":"electronic","value":"9783540685968"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61464-8_44","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:40:47Z","timestamp":1330292447000},"page":"78-92","source":"Crossref","is-referenced-by-count":6,"title":["Dummy elimination in equational rewriting"],"prefix":"10.1007","author":[{"given":"M. C. F.","family":"Ferreira","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"issue":"6","key":"7_CR1","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/BF01810293","volume":"1","author":"F. Bellegarde","year":"1990","unstructured":"F. Bellegarde and P. Lescanne. Termination by completion. Applicable Algebra in Engineering, Communication and Computing, 1(6):79\u201396, 1990.","journal-title":"Applicable Algebra in Engineering, Communication and Computing"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, chapter 6, pages 243\u2013320. Elsevier, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"issue":"8","key":"7_CR3","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1145\/359138.359142","volume":"22","author":"N. Dershowitz","year":"1979","unstructured":"N. Dershowitz and Z. Manna. Proving termination with multiset orderings. Communications ACM, 22(8):465\u2013476, 1979.","journal-title":"Communications ACM"},{"key":"7_CR4","unstructured":"M. C. F. Ferreira. Termination of Term Rewriting \u2014 Wellfoundedness, totality and transformations. PhD thesis, Universiteit Utrecht, November 1995."},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"M. C. F. Ferreira and H. Zantema. Dummy elimination: making termination easier. In H. Reichel, editor, Fundamentals of Computation Theory, 10th International Conference FCT'95, volume 965 of Lecture Notes in Computer Science, pages 243\u2013252. Springer, 1995. Appeared also as technical report UU-CS-1994-47, University of Utrecht, October 1994.","DOI":"10.1007\/3-540-60249-6_56"},{"key":"7_CR6","unstructured":"W. J. Fokkink and H. Zantema. Prefix iteration in basic process algebra: applying termination techniques. In C. V. A. Ponse and S. F. M. van Vlijmen, editors, Proceedings of the second workshop on Algebra of Communicating Processes, ACP 95, volume 95\u201314 of Computing Science Reports, pages 139\u2013156. Department of Mathematics and Computing Science, Eindhoven University of Technology, 1995."},{"key":"7_CR7","unstructured":"A. Geser. Relative termination. PhD thesis, Universit\u00e4t Passau, 1990. Also available as: Report 91-03, Ulmer Informatik-Berichte, Universit\u00e4t Ulm, 1991."},{"key":"7_CR8","first-page":"175","volume-title":"volume 170 of Lecture Notes in Computer Science","author":"J.-P. Jouannaud","year":"1984","unstructured":"J.-P. Jouannaud and M. Mu\u00f1oz. Termination of a set of rules modulo a set of equations. In Proceedings of the seventh International Conference on Automated Deduction, volume 170 of Lecture Notes in Computer Science, pages 175\u2013193. Springer, Napa, CA, 1984."},{"key":"7_CR9","unstructured":"J. W. Klop. Term rewriting systems. In S. Abramsky, D. M. Gabbay, and T. S. E. Maibaum, editors, Handbook of Logic in Computer Science, volume II, pages 1\u2013116. Oxford University Press, 1992."},{"key":"7_CR10","series-title":"volume 1 \u2014 Logical Foundations","first-page":"273","volume-title":"Handbook of Logic in Artificial Intelligence and Logic Programming","author":"D. A. Plaisted","year":"1993","unstructured":"D. A. Plaisted. Equational reasoning and term rewriting systems. In D. Gabbay, C. J. Hogger, and J. A. Robinson, editors, Handbook of Logic in Artificial Intelligence and Logic Programming, volume 1 \u2014 Logical Foundations, pages 273\u2013364. Oxford Science Publications, Clarendon Press-Oxford, 1993."},{"key":"7_CR11","unstructured":"J. Steinbach. Termination of Rewriting \u2014 Extension, Comparison and Automatic Generation of Simplification Orderings. PhD thesis, University of Kaiserslautern, 1994."},{"key":"7_CR12","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1006\/jsco.1994.1003","volume":"17","author":"H. Zantema","year":"1994","unstructured":"H. Zantema. Termination of term rewriting: interpretation and type elimination. Journal of Symbolic Computation, 17:23\u201350, 1994.","journal-title":"Journal of Symbolic Computation"},{"key":"7_CR13","doi-asserted-by":"crossref","first-page":"89","DOI":"10.3233\/FI-1995-24124","volume":"24","author":"H. Zantema","year":"1995","unstructured":"H. Zantema. Termination of term rewriting by semantic labelling. Fundamenta Informaticae, 24:89\u2013105, 1995. Appeared also as technical report RUU-CS-93-24, Utrecht University, July 1993.","journal-title":"Fundamenta Informaticae"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"H. Zantema and A. Geser. A complete characterization of termination of 0p1q \u2192 1r0s. In J. Hsiang, editor, Proceedings of the 6th Conference on Rewriting Techniques and Applications, volume 914 of Lecture Notes in Computer Science, pages 41\u201355. Springer, 1995. Appeared as report UU-CS-1994-44, Utrecht University.","DOI":"10.1007\/3-540-59200-8_46"}],"container-title":["Lecture Notes in Computer Science","Rewriting Techniques and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61464-8_44.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:32:08Z","timestamp":1619573528000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61464-8_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540614647","9783540685968"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-61464-8_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}