{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T09:55:19Z","timestamp":1719827719164},"reference-count":65,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2010,2,25]],"date-time":"2010-02-25T00:00:00Z","timestamp":1267056000000},"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":[[2010,5]]},"DOI":"10.1007\/s00200-010-0122-4","type":"journal-article","created":{"date-parts":[[2010,2,24]],"date-time":"2010-02-24T09:26:19Z","timestamp":1267003579000},"page":"177-225","source":"Crossref","is-referenced-by-count":14,"title":["Termination of narrowing via termination of rewriting"],"prefix":"10.1007","volume":"21","author":[{"given":"Naoki","family":"Nishida","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Germ\u00e1n","family":"Vidal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,2,25]]},"reference":[{"issue":"1","key":"122_CR1","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF03037257","volume":"20","author":"E. Albert","year":"2002","unstructured":"Albert E., Vidal G.: The narrowing-driven approach to functional logic program specialization. New Generation Comput. 20(1), 3\u201326 (2002)","journal-title":"New Generation Comput."},{"key":"122_CR2","doi-asserted-by":"crossref","unstructured":"Alpuente, M., Escobar, S., Iborra, J.: Termination of narrowing using dependency pairs. In: de la Banda M.G., Pontelli E. (eds.) Proceedings of the 24th International Conference on Logic Programming (ICLP 2008), LNCS 5366, pp. 317\u2013331. Springer, Berlin (2008)","DOI":"10.1007\/978-3-540-89982-2_31"},{"key":"122_CR3","doi-asserted-by":"crossref","unstructured":"Alpuente, M., Falaschi, M., Ramis, M.J., Vidal, G.: Narrowing approximations as an optimization for equational logic programs. In: Proceedings of the 5th International Symposium on Programming Language Implementation and Logic Programming (PLILP\u201993), LNCS 714, pp. 391\u2013409. Springer, Berlin (1993)","DOI":"10.1007\/3-540-57186-8_93"},{"issue":"3","key":"122_CR4","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1017\/S1471068404002303","volume":"5","author":"M. Alpuente","year":"2005","unstructured":"Alpuente M., Hanus M., Lucas S., Vidal G.: Specialization of functional logic programs based on needed narrowing. Theory Pract. Logic Program. 5(3), 273\u2013303 (2005)","journal-title":"Theory Pract. Logic Program."},{"key":"122_CR5","doi-asserted-by":"crossref","unstructured":"Antoy, S.: Definitional trees. In: Proceedings of the 3rd International Conference on Algebraic and Logic Programming (ALP\u201992), LNCS 632, pp. 143\u2013157. Springer, Berlin (1992)","DOI":"10.1007\/BFb0013825"},{"key":"122_CR6","doi-asserted-by":"crossref","unstructured":"Antoy, S.: Optimal non-deterministic functional logic computations. In: Proceedings of the International Conference on Algebraic and Logic Programming (ALP\u201997), LNCS 1298, pp. 16\u201330. Springer, Berlin (1997)","DOI":"10.1007\/BFb0027000"},{"key":"122_CR7","doi-asserted-by":"crossref","unstructured":"Antoy, S., Ariola, Z.: Narrowing the narrowing space. In: Proceedings of the 9th International Symposium on Programming Languages: Implementations, Logics, and Programs (PLILP\u201997), LNCS 1292, pp. 1\u201315. Springer, Berlin (1997)","DOI":"10.1007\/BFb0033833"},{"issue":"4","key":"122_CR8","doi-asserted-by":"crossref","first-page":"776","DOI":"10.1145\/347476.347484","volume":"47","author":"S. Antoy","year":"2000","unstructured":"Antoy S., Echahed R., Hanus M.: A needed narrowing strategy. J. ACM 47(4), 776\u2013822 (2000)","journal-title":"J. ACM"},{"key":"122_CR9","doi-asserted-by":"crossref","unstructured":"Antoy, S., Hanus, M.: Overlapping rules and logic variables in functional logic programs. In: Proceedings of the 22nd International Conference on Logic Programming (ICLP\u201906), LNCS 4079, pp. 87\u2013101. Springer, Berlin (2006)","DOI":"10.1007\/11799573_9"},{"key":"122_CR10","doi-asserted-by":"crossref","unstructured":"Arroyo, G., Ramos, J.G., Silva, J., Vidal, G.: Improving offline narrowing-driven partial evaluation using size-change graphs. In: Logic-Based Program Synthesis and Transformation, Revised and Selected Papers from LOPSTR\u201906, LNCS 4407, pp. 60\u201376. Springer, Berlin (2007)","DOI":"10.1007\/978-3-540-71410-1_6"},{"issue":"1-2","key":"122_CR11","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/S0304-3975(99)00207-8","volume":"236","author":"T. Arts","year":"2000","unstructured":"Arts T., Giesl J.: Termination of term rewriting using dependency pairs. Theor. Comput. Sci. 236(1-2), 133\u2013178 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"122_CR12","doi-asserted-by":"crossref","unstructured":"Arts, T., Zantema, H.: Termination of logic programs using semantic unification. In: Proceedings of the 5th International Workshop on Logic Programming Synthesis and Transformation (LOPSTR\u201995), LNCS 1048, pp. 219\u2013233. Springer, Berlin (1996)","DOI":"10.1007\/3-540-60939-3_17"},{"key":"122_CR13","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, MA (1998)"},{"key":"122_CR14","doi-asserted-by":"crossref","unstructured":"Baader, F., Snyder, W.: Unification theory. In: Handbook of Automated Reasoning, pp. 445\u2013532. Elsevier and MIT Press (2001)","DOI":"10.1016\/B978-044450813-3\/50010-2"},{"key":"122_CR15","doi-asserted-by":"crossref","unstructured":"Bert, D., Echahed, R.: Design and implementation of a generic, logic and functional programming language. In: Proceedings of the 1st European Symposium on Programming (ESOP\u201986), LNCS 213, pp. 119\u2013132. Springer, Berlin (1986)","DOI":"10.1007\/3-540-16442-1_9"},{"key":"122_CR16","doi-asserted-by":"crossref","unstructured":"Chabin, J., R\u00e9ty, P.: Narrowing directed by a graph of terms. In: Proceedings of the 4th International Conference on Rewriting Techniques and Applications (RTA\u201991), LNCS 488, pp. 112\u2013123. Springer, Berlin (1991)","DOI":"10.1007\/3-540-53904-2_90"},{"key":"122_CR17","doi-asserted-by":"crossref","unstructured":"Christian, J.: Some termination criteria for narrowing and e-narrowing. In: Proceedings of the 11th International Conference on Automated Deduction (CADE-11), LNCS 607, pp. 582\u2013588. Springer, Berlin (1992)","DOI":"10.1007\/3-540-55602-8_193"},{"issue":"1","key":"122_CR18","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/S0743-1066(99)00006-0","volume":"41","author":"M. Codish","year":"1999","unstructured":"Codish M., Taboch C.: A semantic basis for the termination analysis of logic programs. J. Logic Program. 41(1), 103\u2013123 (1999)","journal-title":"J. Logic Program."},{"key":"122_CR19","doi-asserted-by":"crossref","unstructured":"Comon-Lundh, H., Delaune, S.: The finite variant property: how to get rid of some algebraic properties. In: Proceedings of the 16th International Conference on Term Rewriting and Applications (RTA\u201905), LNCS 3467, pp. 294\u2013307. Springer, Berlin (2005)","DOI":"10.1007\/978-3-540-32033-3_22"},{"key":"122_CR20","doi-asserted-by":"crossref","unstructured":"Darlington, J., Guo, Y.: Narrowing and unification in functional programming: an evaluation mechanism for absolute set abstraction. In: Proceedings of the 3rd International Conference on Rewriting Techniques and Applications (RTA\u201989), LNCS 355, pp. 92\u2013108. Springer, Berlin (1989)","DOI":"10.1007\/3-540-51081-8_102"},{"key":"122_CR21","doi-asserted-by":"crossref","unstructured":"de Dios-Castro, J., L\u00f3pez-Fraguas, F.: Extra variables can be eliminated from functional logic programs. In: Proceedings of the 6th Spanish Conference on Programming and Languages (PROLE\u201906), ENTCS 188, pp. 3\u201319. (2007)","DOI":"10.1016\/j.entcs.2006.05.049"},{"issue":"20","key":"122_CR22","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0743-1066(94)90027-2","volume":"19","author":"D. De Schreye","year":"1994","unstructured":"De Schreye D., Decorte S.: Termination of logic programs: the never-ending story. J. Logic Program. 19(20), 199\u2013260 (1994)","journal-title":"J. Logic Program."},{"key":"122_CR23","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0743-1066(88)90010-6","volume":"5","author":"S. Debray","year":"1988","unstructured":"Debray S., Warren D.S.: Automatic mode inference for logic programs. J. Logic Program. 5, 207\u2013230 (1988)","journal-title":"J. Logic Program."},{"issue":"1&2","key":"122_CR24","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&2), 69\u2013115 (1987)","journal-title":"J. Symb. Comput."},{"key":"122_CR25","unstructured":"Dershowitz, N.: Goal solving as operational semantics. In: Proceedings of ILPS\u201995, pp. 3\u201317. The MIT Press, Cambridge, MA (1995)"},{"key":"122_CR26","unstructured":"Dershowitz, N., Sivakumar, G.: Goal-directed equation solving. In: Proceedings of 7th National Conference on Artificial Intelligence, pp. 166\u2013170. Morgan Kaufmann (1988)"},{"key":"122_CR27","unstructured":"Hanus, M. (ed.): Curry: an Integrated Functional Logic Language. Available at: http:\/\/www.informatik.uni-kiel.de\/~mh\/curry\/"},{"issue":"2-3","key":"122_CR28","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/s10817-007-9087-9","volume":"40","author":"J. Endrullis","year":"2008","unstructured":"Endrullis J., Waldmann J., Zantema H.: Matrix interpretations for proving termination of term rewriting. J. Autom. Reason. 40(2-3), 195\u2013220 (2008)","journal-title":"J. Autom. Reason."},{"issue":"1-2","key":"122_CR29","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1016\/j.tcs.2006.08.035","volume":"367","author":"S. Escobar","year":"2006","unstructured":"Escobar S., Meadows C., Meseguer J.: A rewriting-based inference system for the NRL protocol analyzer and its meta-logical properties. Theor. Comput. Sci. 367(1-2), 162\u2013202 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"122_CR30","doi-asserted-by":"crossref","unstructured":"Escobar, S., Meseguer, J.: Symbolic model checking of infinite-state systems using narrowing. In: Proceedings of 18th International Conference on Rewriting Techniques and Applications (RTA\u201907), LNCS 4533, pp. 153\u2013168. Springer, Berlin (2007)","DOI":"10.1007\/978-3-540-73449-9_13"},{"key":"122_CR31","unstructured":"Fribourg, L.: SLOG: a logic programming language interpreter based on clausal superposition and rewriting. In: Proceedings of the Symposium on Logic Programming (SLP\u201985), pp. 172\u2013185. IEEE Press (1985)"},{"key":"122_CR32","doi-asserted-by":"crossref","unstructured":"Giesl, J., Schneider-Kamp, P., Thiemann, R.: AProVE 1.2: automatic termination proofs in the dependency pair framework. In: Proceedings of the International Joint Conference on Automated Reasoning (IJCAR\u201906), LNCS 4130, pp. 281\u2013286. Springer, Berlin (2006)","DOI":"10.1007\/11814771_24"},{"key":"122_CR33","first-page":"297","volume-title":"Proceedings of the 17th International Conference on Term Rewriting and Applications (RTA 2006), LNCS 4098","author":"J. Giesl","year":"2006","unstructured":"Giesl J., Swiderski S., Schneider-Kamp P., Thiemann R.: Automated termination analysis for haskell: from term rewriting to programming languages. In: Pfenning, F. (eds) Proceedings of the 17th International Conference on Term Rewriting and Applications (RTA 2006), LNCS 4098, pp. 297\u2013312. Springer, Berlin (2006)"},{"key":"122_CR34","doi-asserted-by":"crossref","unstructured":"Giesl, J., Thiemann, R., Schneider-Kamp, P.: The dependency pair framework: combining techniques for automated termination proofs. In: Proceedings of the 11th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR\u201904), LNCS 3452, pp. 301\u2013331. Springer, Berlin (2005)","DOI":"10.1007\/978-3-540-32275-7_21"},{"issue":"3","key":"122_CR35","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/s10817-006-9057-7","volume":"37","author":"J. Giesl","year":"2006","unstructured":"Giesl J., Thiemann R., Schneider-Kamp P., Falke S.: Mechanizing and improving dependency pairs. J. Autom. Reason. 37(3), 155\u2013203 (2006)","journal-title":"J. Autom. Reason."},{"key":"122_CR36","doi-asserted-by":"crossref","unstructured":"Hanus, M.: Compiling logic programs with equality. In: Proceedings of the 2nd International Workshop on Programming Language Implementation and Logic Programming (PLILP\u201990), LNCS 456, pp. 387\u2013401. Springer, Berlin (1990)","DOI":"10.1007\/BFb0024197"},{"key":"122_CR37","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1016\/0743-1066(94)90034-5","volume":"19\u201320","author":"M. Hanus","year":"1994","unstructured":"Hanus M.: The integration of functions into logic programming: from theory to practice. J. Logic Program. 19\u201320, 583\u2013628 (1994)","journal-title":"J. Logic Program."},{"key":"122_CR38","doi-asserted-by":"crossref","unstructured":"Hanus, M.: Multi-paradigm declarative languages. In: Proceedings of the International Conference on Logic Programming (ICLP 2007), LNCS 4670, pp. 45\u201375. Springer, Berlin (2007)","DOI":"10.1007\/978-3-540-74610-2_5"},{"key":"122_CR39","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0015791","volume-title":"Foundations of Equational Logic Programming, LNAI 353","author":"S. H\u00f6lldobler","year":"1989","unstructured":"H\u00f6lldobler S.: Foundations of Equational Logic Programming, LNAI 353. Springer, Berlin (1989)"},{"key":"122_CR40","unstructured":"Huet, G., L\u00e9vy, J.J.: Computations in orthogonal rewriting systems, Part I\u00a0+\u00a0II. In: Lassez, J.L., Plotkin, G.D. (eds.) Computational Logic\u2014Essays in Honor of Alan Robinson. pp. 395\u2013443 (1992)"},{"key":"122_CR41","doi-asserted-by":"crossref","unstructured":"Hullot, J.M.: Canonical forms and unification. In: Proceedings of the 5th International Conference on Automated Deduction, LNCS 87, pp. 318\u2013334. Springer, Berlin (1980)","DOI":"10.21236\/ADA087640"},{"key":"122_CR42","doi-asserted-by":"crossref","unstructured":"Iborra J., Nishida, N., Vidal, G.: Goal-directed and relative dependency pairs for proving the termination of narrowing. In: De Schreye D. (ed.) Proceedings of the 19th International Symposium on Logic-based Program Synthesis and Transformation (LOPSTR 2009). Springer, Berlin, LNCS (to appear) (2010)","DOI":"10.1007\/978-3-642-12592-8_5"},{"key":"122_CR43","doi-asserted-by":"crossref","unstructured":"Jacquemard, F., Rusinowitch, M., Vigneron, L.: Compiling and verifying security protocols. In: Proceedings of the 7th International Conference on Logic for Programming and Automated Reasoning (LPAR\u201900), LNAI 1955, pp. 131\u2013160. Springer, Berlin (2000)","DOI":"10.1007\/3-540-44404-1_10"},{"key":"122_CR44","volume-title":"Partial Evaluation and Automatic Program Generation","author":"N.D. Jones","year":"1993","unstructured":"Jones N.D., Gomard C.K., Sestoft P.: Partial Evaluation and Automatic Program Generation. Prentice-Hall, Englewood Cliffs, NJ (1993)"},{"key":"122_CR45","first-page":"143","volume":"32","author":"J.W. Klop","year":"1987","unstructured":"Klop J.W.: Term rewriting systems: a tutorial. Bull. Eur. Assoc. Theor. Comput. Sci. 32, 143\u2013183 (1987)","journal-title":"Bull. Eur. Assoc. Theor. Comput. Sci."},{"key":"122_CR46","first-page":"257","volume-title":"Proceedings of the 17th International Conference on Term Rewriting and Applications (RTA 2006), LNCS 4098","author":"A. Koprowski","year":"2006","unstructured":"Koprowski A.: TPA: Termination proved automatically. In: Pfenning, F. (eds) Proceedings of the 17th International Conference on Term Rewriting and Applications (RTA 2006), LNCS 4098, pp. 257\u2013266. Springer, Berlin (2006)"},{"key":"122_CR47","unstructured":"Kusakari, K., Nakamura, M., Toyama, Y.: Argument filtering transformation. In: Proceedings of the International Conference on Principles and Practice of Declarative Programming (PPDP\u201999), LNCS 1702, pp. 48\u201362. Springer, Berlin (1999)"},{"key":"122_CR48","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1007\/978-3-540-25951-0_14","volume-title":"Program Development in Computational Logic, LNCS 3049","author":"N. Lindenstrauss","year":"2004","unstructured":"Lindenstrauss N., Sagiv Y., Serebrenik A.: Proving termination for logic programs by the query-mapping pairs approach. In: Bruynooghe, M., Lau, K.-K. (eds) Program Development in Computational Logic, LNCS 3049, pp. 453\u2013498. Springer, Berlin (2004)"},{"key":"122_CR49","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-83189-8","volume-title":"Foundations of Logic Programming","author":"J.W. Lloyd","year":"1987","unstructured":"Lloyd J.W.: Foundations of Logic Programming. 2nd edn. Springer, Berlin (1987)","edition":"2"},{"key":"122_CR50","doi-asserted-by":"crossref","unstructured":"L\u00f3pez-Fraguas, F., S\u00e1nchez-Hern\u00e1ndez, J.: TOY: a multiparadigm declarative system. In: Proceedings of the 10th International Conference on Rewriting Techniques and Applications (RTA\u201999), LNCS 1631, pp. 244\u2013247. Springer, Berlin (1999)","DOI":"10.1007\/3-540-48685-2_19"},{"key":"122_CR51","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1145\/357162.357169","volume":"4","author":"A. Martelli","year":"1982","unstructured":"Martelli A., Montanari U.: An efficient unification algorithm. ACM Trans. Program. Lang. Syst. 4, 258\u2013282 (1982)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"122_CR52","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/j.entcs.2004.06.024","volume":"117","author":"J. Meseguer","year":"2005","unstructured":"Meseguer J., Thati P.: Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols. Electron. Notes Theor. Comput. Sci. 117, 153\u2013182 (2005)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"122_CR53","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/BF01190830","volume":"5","author":"A. Middeldorp","year":"1994","unstructured":"Middeldorp A., Hamoen E.: Completeness results for basic narrowing. Appl. Algebra Eng. Commun. Comput. 5, 213\u2013253 (1994)","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"key":"122_CR54","doi-asserted-by":"crossref","unstructured":"Moreno-Navarro, J.J., Kuchen, H., Loogen, R., Rodriguez-Artalejo, M.: Lazy narrowing in a graph machine. In: Proceedings of the 2nd International Conference on Algebraic and Logic Programming (ALP\u201990), LNCS 463, pp. 298\u2013317. Springer, Berlin (1990)","DOI":"10.1007\/3-540-53162-9_47"},{"issue":"3","key":"122_CR55","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0743-1066(92)90024-W","volume":"12","author":"J.J. Moreno-Navarro","year":"1992","unstructured":"Moreno-Navarro J.J., Rodr\u00edguez-Artalejo M.: Logic programming with functions and predicates: the language babel. J. Logic Program. 12(3), 191\u2013224 (1992)","journal-title":"J. Logic Program."},{"key":"122_CR56","unstructured":"Nishida, N., Miura, K.: Dependency graph method for proving termination of narrowing. In: Proceedings of the 8th International Workshop on Termination (WST\u201906), pp. 12\u201316. (2006)"},{"key":"122_CR57","doi-asserted-by":"crossref","unstructured":"Nishida, N., Sakai, M., Sakabe, T.: Narrowing-based simulation of term rewriting systems with extra variables, ENTCS 86(3). (2003)","DOI":"10.1016\/S1571-0661(04)80693-5"},{"key":"122_CR58","doi-asserted-by":"crossref","unstructured":"Ramos, J.G., Silva, J., Vidal, G.: Fast narrowing-driven partial evaluation for inductively sequential systems. In: Proceedings of the 10th ACM SIGPLAN International Conference on Functional Programming (ICFP\u201905), pp. 228\u2013239. ACM Press (2005)","DOI":"10.1145\/1086365.1086394"},{"key":"122_CR59","unstructured":"Reddy, U.S.: Narrowing as the operational semantics of functional languages. In: Proceedings of the Symposium on Logic Programming (SLP\u201985) pp. 138\u2013151. IEEE Press (1985)"},{"issue":"1","key":"122_CR60","first-page":"1","volume":"11","author":"P. Schneider-Kamp","year":"2009","unstructured":"Schneider-Kamp P., Giesl J., Serebrenik A., Thiemann R.: Automated termination proofs for logic programs by term rewriting. ACM Trans. Program. Lang. 11(1), 1\u201352 (2009)","journal-title":"ACM Trans. Program. Lang."},{"key":"122_CR61","doi-asserted-by":"crossref","unstructured":"Sheard, T.: Type-level computation using narrowing in \u03a9mega. In: Proceedings of the Workshop on Programming Languages meets Program Verification (PLPV\u201906), ENTCS 174, pp. 105\u2013128. (2007)","DOI":"10.1016\/j.entcs.2006.10.040"},{"issue":"4","key":"122_CR62","doi-asserted-by":"crossref","first-page":"622","DOI":"10.1145\/321850.321859","volume":"21","author":"J.R. Slagle","year":"1974","unstructured":"Slagle J.R.: Automated theorem-proving for theories with simplifiers, commutativity and associativity. J. ACM 21(4), 622\u2013642 (1974)","journal-title":"J. ACM"},{"issue":"1\/2","key":"122_CR63","doi-asserted-by":"crossref","first-page":"47","DOI":"10.3233\/FI-1995-24123","volume":"24","author":"J. Steinbach","year":"1995","unstructured":"Steinbach J.: Simplification orderings: histrory of results. Fundam. Inf. 24(1\/2), 47\u201387 (1995)","journal-title":"Fundam. Inf."},{"issue":"1","key":"122_CR64","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1145\/371282.371357","volume":"2","author":"S. Verbaeten","year":"2001","unstructured":"Verbaeten S., Sagonas K., De Schreye D.: Termination proofs for logic programs with tabling. ACM Trans. Comput. Logic 2(1), 57\u201392 (2001)","journal-title":"ACM Trans. Comput. Logic"},{"key":"122_CR65","first-page":"113","volume-title":"Proceedings of the 9th International Symposium on Functional and Logic Languages (FLOPS 2008), LNCS 4989","author":"G. Vidal","year":"2008","unstructured":"Vidal G.: Termination of narrowing in left-linear constructor systems. In: Garrigue, J., Hermenegildo, M. (eds) Proceedings of the 9th International Symposium on Functional and Logic Languages (FLOPS 2008), LNCS 4989, pp. 113\u2013129. Springer, Berlin (2008)"}],"container-title":["Applicable Algebra in Engineering, Communication and Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-010-0122-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00200-010-0122-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-010-0122-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,30]],"date-time":"2023-05-30T16:12:15Z","timestamp":1685463135000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00200-010-0122-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,2,25]]},"references-count":65,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,5]]}},"alternative-id":["122"],"URL":"https:\/\/doi.org\/10.1007\/s00200-010-0122-4","relation":{},"ISSN":["0938-1279","1432-0622"],"issn-type":[{"value":"0938-1279","type":"print"},{"value":"1432-0622","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,2,25]]}}}