{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:16:33Z","timestamp":1725552993324},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642125911"},{"type":"electronic","value":"9783642125928"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12592-8_5","type":"book-chapter","created":{"date-parts":[[2010,4,28]],"date-time":"2010-04-28T06:28:59Z","timestamp":1272436139000},"page":"52-66","source":"Crossref","is-referenced-by-count":5,"title":["Goal-Directed and Relative Dependency Pairs for Proving the Termination of Narrowing"],"prefix":"10.1007","author":[{"given":"Jos\u00e9","family":"Iborra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Naoki","family":"Nishida","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Germ\u00e1n","family":"Vidal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/978-3-540-89982-2_31","volume-title":"Logic Programming","author":"M. Alpuente","year":"2008","unstructured":"Alpuente, M., Escobar, S., Iborra, J.: Termination of Narrowing Using Dependency Pairs. In: Garcia de la Banda, M., Pontelli, E. (eds.) ICLP 2008. LNCS, vol.\u00a05366, pp. 317\u2013331. Springer, Heidelberg (2008)"},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/11799573_9","volume-title":"Logic Programming","author":"S. Antoy","year":"2006","unstructured":"Antoy, S., Hanus, M.: Overlapping Rules and Logic Variables in Functional Logic Programs. In: Etalle, S., Truszczy\u0144ski, M. (eds.) ICLP 2006. LNCS, vol.\u00a04079, pp. 87\u2013101. Springer, Heidelberg (2006)"},{"issue":"1-2","key":"5_CR3","doi-asserted-by":"publisher","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. Theoretical Computer Science\u00a0236(1-2), 133\u2013178 (2000)","journal-title":"Theoretical Computer Science"},{"key":"5_CR4","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":"5_CR5","doi-asserted-by":"crossref","unstructured":"Codish, M., Lagoon, V., Stuckey, P.J.: Solving partial order constraints for lpo termination. CoRR, abs\/cs\/0512067 (2005)","DOI":"10.1007\/11805618_2"},{"key":"5_CR6","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/11916277_3","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"M. Codish","year":"2006","unstructured":"Codish, M., Schneider-Kamp, P., Lagoon, V., Thiemann, R., Giesl, J.: Sat solving for argument filterings. In: Hermann, M., Voronkov, A. (eds.) LPAR 2006. LNCS (LNAI), vol.\u00a04246, pp. 30\u201344. Springer, Heidelberg (2006)"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"de Dios-Castro, J., L\u00f3pez-Fraguas, F.: Extra Variables Can Be Eliminated from Functional Logic Programs. In: Proc. of the 6th Spanish Conf. on Programming and Languages (PROLE 2006), ENTCS, vol.\u00a0188, pp. 3\u201319 (2007)","DOI":"10.1016\/j.entcs.2006.05.049"},{"issue":"1,2","key":"5_CR8","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/S0747-7171(87)80022-6","volume":"3","author":"N. Dershowitz","year":"1987","unstructured":"Dershowitz, N.: Termination of Rewriting. Journal of Symbolic Computation\u00a03(1,2), 69\u2013115 (1987)","journal-title":"Journal of Symbolic Computation"},{"key":"5_CR9","unstructured":"Geser, A.: Relative termination. Dissertation, Fakult\u00e4t f\u00fcr Mathematik und Informatik, Universit\u00e4t Passau, Germany (1990)"},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/11805618_23","volume-title":"Term Rewriting and Applications","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. (ed.) RTA 2006. LNCS, vol.\u00a04098, pp. 297\u2013312. Springer, Heidelberg (2006)"},{"key":"5_CR11","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/978-3-540-32275-7_21","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"J. Giesl","year":"2005","unstructured":"Giesl, J., Thiemann, R., Schneider-Kamp, P.: The Dependency Pair Framework: Combining Techniques for Automated Termination Proofs. In: Baader, F., Voronkov, A. (eds.) LPAR 2004. LNCS (LNAI), vol.\u00a03452, pp. 301\u2013331. Springer, Heidelberg (2005)"},{"issue":"3","key":"5_CR12","doi-asserted-by":"publisher","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. Journal of Automated Reasoning\u00a037(3), 155\u2013203 (2006)","journal-title":"Journal of Automated Reasoning"},{"key":"5_CR13","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1016\/0743-1066(94)90034-5","volume":"19","author":"M. Hanus","year":"1994","unstructured":"Hanus, M.: The Integration of Functions into Logic Programming: From Theory to Practice. Journal of Logic Programming\u00a019,20, 583\u2013628 (1994)","journal-title":"Journal of Logic Programming"},{"key":"5_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/978-3-540-25979-4_18","volume-title":"Rewriting Techniques and Applications","author":"N. Hirokawa","year":"2004","unstructured":"Hirokawa, N., Middeldorp, A.: Dependency pairs revisited. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol.\u00a03091, pp. 249\u2013268. Springer, Heidelberg (2004)"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Iborra, J., Nishida, N., Vidal, G.: Goal-directed Dependency Pairs and its Application to Proving the Termination of Narrowing (2010), http:\/\/users.dsic.upv.es\/~gvidal\/german\/papers.html","DOI":"10.1007\/978-3-642-12592-8_5"},{"key":"5_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/10704567_3","volume-title":"Principles and Practice of Declarative Programming","author":"K. Kusakari","year":"1999","unstructured":"Kusakari, K., Nakamura, M., Toyama, Y.: Argument Filtering Transformation. In: Nadathur, G. (ed.) PPDP 1999. LNCS, vol.\u00a01702, pp. 48\u201362. Springer, Heidelberg (1999)"},{"key":"5_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/978-3-540-73449-9_23","volume-title":"Term Rewriting and Applications","author":"C. Marche","year":"2007","unstructured":"Marche, C., Zantema, H.: The termination competition. In: Baader, F. (ed.) RTA 2007. LNCS, vol.\u00a04533, pp. 303\u2013313. Springer, Heidelberg (2007)"},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"Nishida, N., Vidal, G.: Termination of Narrowing via Termination of Rewriting, Submitted for publication (2009)","DOI":"10.1007\/s00200-010-0122-4"},{"key":"5_CR19","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3661-8","volume-title":"Advanced topics in term rewriting","author":"E. Ohlebusch","year":"2002","unstructured":"Ohlebusch, E.: Advanced topics in term rewriting. Springer-Verlag, UK (2002)"},{"key":"5_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-540-71410-1_13","volume-title":"Logic-Based Program Synthesis and Transformation","author":"P. Schneider-Kamp","year":"2007","unstructured":"Schneider-Kamp, P., Giesl, J., Serebrenik, A., Thiemann, R.: Automated Termination Analysis for Logic Programs by Term Rewriting. In: Puebla, G. (ed.) LOPSTR 2006. LNCS, vol.\u00a04407, pp. 177\u2013193. Springer, Heidelberg (2007)"},{"key":"5_CR21","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/978-3-540-74621-8_18","volume-title":"Frontiers of Combining Systems","author":"P. Schneider-Kamp","year":"2007","unstructured":"Schneider-Kamp, P., Thiemann, R., Annov, E., Codish, M., Giesl, J.: Proving termination using recursive path orders and sat solving. In: Konev, B., Wolter, F. (eds.) FroCos 2007. LNCS (LNAI), vol.\u00a04720, pp. 267\u2013282. Springer, Heidelberg (2007)"},{"issue":"4","key":"5_CR22","doi-asserted-by":"publisher","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. Journal of the ACM\u00a021(4), 622\u2013642 (1974)","journal-title":"Journal of the ACM"},{"issue":"1\/2","key":"5_CR23","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. Fundamenta Informaticae\u00a024(1\/2), 47\u201387 (1995)","journal-title":"Fundamenta Informaticae"},{"issue":"4","key":"5_CR24","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/BF03177743","volume":"32","author":"X. Urbain","year":"2004","unstructured":"Urbain, X.: Modular & incremental automated termination proofs. Int. Journal of Approx. Reasoning\u00a032(4), 315\u2013355 (2004)","journal-title":"Int. Journal of Approx. Reasoning"},{"key":"5_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/978-3-540-78969-7_10","volume-title":"Functional and Logic Programming","author":"G. Vidal","year":"2008","unstructured":"Vidal, G.: Termination of Narrowing in Left-Linear Constructor Systems. In: Garrigue, J., Hermenegildo, M.V. (eds.) FLOPS 2008. LNCS, vol.\u00a04989, pp. 113\u2013129. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Logic-Based Program Synthesis and Transformation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12592-8_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,26]],"date-time":"2021-10-26T20:22:57Z","timestamp":1635279777000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12592-8_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642125911","9783642125928"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12592-8_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}