{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,14]],"date-time":"2023-09-14T15:49:19Z","timestamp":1694706559348},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[1996,11,1]],"date-time":"1996-11-01T00:00:00Z","timestamp":846806400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["AAECC"],"published-print":{"date-parts":[[1996,11]]},"DOI":"10.1007\/bf01293264","type":"journal-article","created":{"date-parts":[[2005,3,25]],"date-time":"2005-03-25T03:41:51Z","timestamp":1111722111000},"page":"469-511","source":"Crossref","is-referenced-by-count":8,"title":["An Improved General Path Order"],"prefix":"10.1007","volume":"7","author":[{"given":"A.","family":"Geser","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF01293264_CR1","volume-title":"Technical Report UU-CS-1994-20","author":"T. Arts","year":"1994","unstructured":"Arts, T., Zantema, H.: Termination of logic programs via labelled term rewriting systems. Technical Report UU-CS-1994-20, Universiteit Utrecht, The Netherlands, 1994"},{"key":"BF01293264_CR2","volume-title":"Formal Techniques in Artificial Intelligence: A Source-Book","author":"J. Avenhaus","year":"1990","unstructured":"Avenhaus, J., Madlener, K.: Term rewriting and equational reasoning. In: Banerji, R. B. (ed) Formal Techniques in Artificial Intelligence: A Source-Book. Elsevier Science Publishers, North-Holland, 1990"},{"key":"BF01293264_CR3","unstructured":"Bachmair, L., Dershowitz, N., Plaisted, D.A.: Completion without failure. In: Ait-Kaci, H., Nivat, M. (eds) Resolution of Equations in Algebraic Structures 2: Rewriting Techniques, pages 1\u201330. Academic Press, 1989"},{"key":"BF01293264_CR4","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/BF01810293","volume":"1","author":"F. Bellegarde","year":"1990","unstructured":"Bellegarde, F., Lescanne, P.: Termination by completion. AAECC 1, 79\u201396 (1990)","journal-title":"AAECC"},{"key":"BF01293264_CR5","volume-title":"Technical Report MIP-8804","author":"M. Broy","year":"1988","unstructured":"Broy, M.: An example for the design of distributed systems in a formal setting: The lift problem. Technical Report MIP-8804, Universit\u00e4t Passau, Germany, 1988"},{"key":"BF01293264_CR6","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1016\/0304-3975(92)90022-8","volume":"103","author":"M. Dauchet","year":"1992","unstructured":"Dauchet, M.: Simulation of Turing machines by a regular rule. Theoret. Comput. Sci.,103, 409\u2013420 (1992)","journal-title":"Theoret. Comput. Sci."},{"key":"BF01293264_CR7","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1016\/0020-0190(79)90071-1","volume":"9","author":"N. Dershowitz","year":"1979","unstructured":"Dershowitz, N.: A note on simplification orderings. Inform. Process. Lett.9, 212\u2013215, 1979","journal-title":"Inform. Process. Lett."},{"issue":"3","key":"BF01293264_CR8","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0304-3975(82)90026-3","volume":"17","author":"N. Dershowitz","year":"1982","unstructured":"Dershowitz, N.: Orderings for term rewriting systems. Theoret. Comput. Sci.17(3), 279\u2013301 (March 1982)","journal-title":"Theoret. Comput. Sci."},{"issue":"1\u20132","key":"BF01293264_CR9","doi-asserted-by":"crossref","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. Symb. Comput.3(1\u20132), 69\u2013115, Feb.\/April 1987. Corrigendum: 4 (3), 409\u2013410, Dec. 1987","journal-title":"J. Symb. Comput."},{"key":"BF01293264_CR10","series-title":"LNCS vol. 690","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1007\/3-540-56868-9_16","volume-title":"5th Int. Conf. Rewriting Techniques and Applications","author":"N. Dershowitz","year":"1993","unstructured":"Dershowitz, N., Hoot, C.: Topics in termination. In: Kirchner, C. (ed), 5th Int. Conf. Rewriting Techniques and Applications, pp. 198\u2013212. LNCS vol. 690, Berlin, Heidelberg, New York: Springer 1993"},{"issue":"2","key":"BF01293264_CR11","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0304-3975(94)00275-4","volume":"142","author":"N. Dershowitz","year":"1995","unstructured":"Dershowitz, N., Hoot, C.: Natural termination. Theoret. Comput. Sci.142 (2), 179\u2013207, 1995","journal-title":"Theoret. Comput. Sci."},{"key":"BF01293264_CR12","first-page":"162","volume":"43","author":"N. Dershowitz","year":"1991","unstructured":"Dershowitz, N., Jouannaud, J.-P.: Notations for rewriting. Bulletin of the EATCS,43, 162\u2013172, (1991)","journal-title":"Bulletin of the EATCS"},{"key":"BF01293264_CR13","unstructured":"Dershowitz, N., Jouannaud, J.-P.: Rewrite systems. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, volume B (Formal Models and Semantics), pp. 243\u2013320. Elsevier \u2014 The MIT Press, 1991"},{"key":"BF01293264_CR14","series-title":"LNCS vol. 914","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1007\/3-540-59200-8_82","volume-title":"6th Int. Conf. Rewriting Techniques and Applications","author":"N. Dershowitz","year":"1995","unstructured":"Dershowitz, N., Jouannaud, J.-P., Klop, J. W.: Problems in rewriting III. In: Hsiang, J. (ed), 6th Int. Conf. Rewriting Techniques and Applications, pp. 457\u2013471. LNCS vol. 914, Berlin, Heidelberg, New York: Springer 1995"},{"issue":"8","key":"BF01293264_CR15","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1145\/359138.359142","volume":"22","author":"N. Dershowitz","year":"1979","unstructured":"Dershowitz, N., Manna, Z.: Proving termination with multiset orderings. Communications of the ACM,22(8), 465\u2013476 (1979)","journal-title":"Communications of the ACM"},{"key":"BF01293264_CR16","first-page":"538","volume-title":"LNCS vol. 310","author":"N. Dershowitz","year":"1988","unstructured":"Dershowitz, N., Okada, M., Sivakumar, G.: Canonical conditional rewrite systems. In 9th Int. Conf. Automated Deduction, pp 538\u2013549. LNCS vol. 310, Berlin, Heidelberg, New York: Springer 1988"},{"key":"BF01293264_CR17","volume-title":"Research report FORWISS","author":"U. Fraus","year":"1992","unstructured":"Fraus, U.: Verifying the specification of a technical software system by induction. Research report FORWISS, Universit\u00e4t Passau, Germany, 1992"},{"key":"BF01293264_CR18","volume-title":"Technical Report MIP-9401","author":"U. Fraus","year":"1994","unstructured":"Fraus, U., Inductive theorem proving for algebraic specifications-TIP system user's manual. Technical Report MIP-9401, Universit\u00e4t Passau, Germany, Feb. 1994"},{"key":"BF01293264_CR19","volume-title":"Technical Report 92-13","author":"A. Geser","year":"1992","unstructured":"Geser, A.: On a monotonie semantic path ordering. Technical Report 92-13, Ulmer Informatik-Berichte, Universit\u00e4t Ulm, Germany, 1992"},{"key":"BF01293264_CR20","volume-title":"Technical Report MIP-9407","author":"A. Geser","year":"1994","unstructured":"Geser, A.: An improved general path order. Technical Report MIP-9407, Universit\u00e4t Passau, Germany, June 1994"},{"key":"BF01293264_CR21","volume-title":"G\u00f6del, Escher, Bach: An eternal golden braid","author":"D. R. Hofstadter","year":"1979","unstructured":"Hofstadter, D. R.: G\u00f6del, Escher, Bach: An eternal golden braid. Basic Books, New York, 1979"},{"key":"BF01293264_CR22","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1145\/322217.322230","volume":"27","author":"G. Huet","year":"1980","unstructured":"Huet, G.: Confluent reductions: abstract properties and applications to term rewriting systems. J Assoc. Comput. Mach.27, 797\u2013821 (1980)","journal-title":"J Assoc. Comput. Mach."},{"key":"BF01293264_CR23","volume-title":"Technical Report 283","author":"G. Huet","year":"1978","unstructured":"Huet, G., Lankford, D.: On the uniform halting problem for term rewriting systems. Technical Report 283, INRIA, Rocquencourt, FR, Mar. 1978"},{"key":"BF01293264_CR24","doi-asserted-by":"crossref","unstructured":"Huet, G., Oppen, D. C: Equations and rewrite rules \u2014 a survey. In: Book, R. (ed) Formal Languages: Perspectives and Open Problems, pp 349\u2013405. Academic Press, 1980","DOI":"10.1016\/B978-0-12-115350-2.50017-8"},{"key":"BF01293264_CR25","unstructured":"Jouannaud, J.-P., Lescanne, P., Reinig, F.: Recursive decomposition ordering. In: Bj\u00f8rner, D. (ed), Formal description of programming concepts 2, pp 331\u2013348. North-Holland, 1982"},{"key":"BF01293264_CR26","volume-title":"Attempts for generalizing the recursive path orderings","author":"S. Kamin","year":"1980","unstructured":"Kamin, S., L\u00e9vy, J.-J.: Attempts for generalizing the recursive path orderings. Manuscript; copy available at Dept. of Computer Science, Univ. of Illinois at Urbana-Champaign, Feb. 1980"},{"key":"BF01293264_CR27","first-page":"173","volume-title":"LNCS vol. 185","author":"D. Kapur","year":"1985","unstructured":"Kapur, D., Narendran, P., Sivakumar, G.: A path ordering for proving termination of term rewriting system. In: 10th Colloquium on Trees in Algebra and Programming, pp 173\u2013185. LNCS vol. 185, Berlin, Heidelberg, New York: Springer 1985"},{"key":"BF01293264_CR28","first-page":"1","volume-title":"Handbook of Logic in Computer Science, volume II","author":"J. W. Klop","year":"1992","unstructured":"Klop, J. W.: Term rewrite systems. In: Abramsky, S., Gabbay, D. M., Maibaum, T. (eds), Handbook of Logic in Computer Science, volume II, pp 1\u2013116. Clarendon Press, Oxford, UK, 1992"},{"key":"BF01293264_CR29","unstructured":"Knuth, D. E., Bendix, P. B.: Simple word problems in universal algebras. In: Leech, J. (ed), Computational Problems in Abstract Algebra, pp 263\u2013297. Pergamon Press, 1970"},{"key":"BF01293264_CR30","volume-title":"Technical Report MTP-3","author":"D. S. Lankford","year":"1979","unstructured":"Lankford, D. S.: On proving term rewriting systems are noetherian. Technical Report MTP-3, Louisiana Technical University, Math. Dept., Ruston, LA, 1979"},{"key":"BF01293264_CR31","unstructured":"Lescanne, P.: Uniform termination of term rewriting systems: Recursive decomposition ordering with status. In: Courcelle, B. (ed), 6th Colloquium on Trees in Algebra and Programming, pp 181\u2013194, Bordeaux, France, Mar. 1984"},{"key":"BF01293264_CR32","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/BF00302640","volume":"6","author":"P. Lescanne","year":"1990","unstructured":"Lescanne, P.: On the recursive decomposition ordering with lexicographic status and other related orderings. J. Automated Reasoning,6, 39\u201349 (1990)","journal-title":"J. Automated Reasoning"},{"key":"BF01293264_CR33","volume-title":"Handbook of Logic in Artificial Intelligence and Logic Programming, volume 4","author":"D. A. Plaisted","year":"1993","unstructured":"Plaisted, D. A.: Term rewriting systems: In: Gabbay, D. M., Hogger, C. J., Robinson, J. A.(eds), Handbook of Logic in Artificial Intelligence and Logic Programming, volume 4, Chap. 2. Clarendon Press, Oxford, UK, 1993"},{"issue":"1\u20132","key":"BF01293264_CR34","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/S0747-7171(87)80023-8","volume":"3","author":"M. Rusinowitch","year":"1987","unstructured":"Rusinowitch, M.: Path of subterms ordering and recursive decomposition ordering revisited. J. Symb. Comput,3(1\u20132), 117\u2013131 (1987)","journal-title":"J. Symb. Comput"},{"key":"BF01293264_CR35","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0020-0190(87)90122-0","volume":"25","author":"Y. Toyama","year":"1987","unstructured":"Toyama, Y.: Counterexamples to termination for the direct sum of term rewriting systems. Inform. Process. Lett.25, 141\u2013143 (1987)","journal-title":"Inform. Process. Lett."},{"key":"BF01293264_CR36","doi-asserted-by":"crossref","unstructured":"Wirth, C.-P., Gr\u00e4mlich, B.: A constructor-based inductive validity in positive\/negative-conditional equational specifications. J. Symb. Comput.11, 1994","DOI":"10.1007\/3-540-56393-8_15"},{"key":"BF01293264_CR37","doi-asserted-by":"crossref","first-page":"89","DOI":"10.3233\/FI-1995-24124","volume":"24","author":"H. Zantema","year":"1995","unstructured":"Zantema, H.: Termination of term rewriting by semantic labelling. Fundamenta Informaticae24, 89\u2013105 (1995)","journal-title":"Fundamenta Informaticae"}],"container-title":["Applicable Algebra in Engineering, Communication and Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01293264.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01293264\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01293264","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,6]],"date-time":"2020-04-06T13:48:43Z","timestamp":1586180923000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01293264"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,11]]},"references-count":37,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1996,11]]}},"alternative-id":["BF01293264"],"URL":"https:\/\/doi.org\/10.1007\/bf01293264","relation":{},"ISSN":["0938-1279","1432-0622"],"issn-type":[{"value":"0938-1279","type":"print"},{"value":"1432-0622","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,11]]}}}