{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:43:52Z","timestamp":1725522232862},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540899815"},{"type":"electronic","value":"9783540899822"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-89982-2_31","type":"book-chapter","created":{"date-parts":[[2008,12,15]],"date-time":"2008-12-15T03:09:15Z","timestamp":1229310555000},"page":"317-331","source":"Crossref","is-referenced-by-count":2,"title":["Termination of Narrowing Using Dependency Pairs"],"prefix":"10.1007","author":[{"given":"Mar\u00eda","family":"Alpuente","sequence":"first","affiliation":[]},{"given":"Santiago","family":"Escobar","sequence":"additional","affiliation":[]},{"given":"Jos\u00e9","family":"Iborra","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"31_CR1","first-page":"105","volume":"188","author":"B. Alarc\u00f3n","year":"2007","unstructured":"Alarc\u00f3n, B., Guti\u00e9rrez, R., Iborra, J., Lucas, S.: Proving termination of context-sensitive rewriting with Mu\u2013Term. ENTCS\u00a0188, 105\u2013115 (2007)","journal-title":"ENTCS"},{"key":"31_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-70590-1_1","volume-title":"Rewriting Techniques and Applications","author":"M. Alpuente","year":"2008","unstructured":"Alpuente, M., Escobar, S., Iborra, J.: Modular Termination of Basic Narrowing. In: Voronkov, A. (ed.) RTA 2008. LNCS, vol.\u00a05117, pp. 1\u201316. Springer, Heidelberg (2008)"},{"key":"31_CR3","unstructured":"Alpuente, M., Escobar, S., Iborra, J.: Dependency Pairs for the Termination of Narrowing. Technical Report DSIC-II\/08\/08, DSIC-UPV (2008)"},{"key":"31_CR4","doi-asserted-by":"crossref","unstructured":"Alpuente, M., Escobar, S., Iborra, J.: Termination of Narrowing revisited. Theor. Comput. Sci. (to appear, 2008)","DOI":"10.1016\/j.tcs.2009.07.037"},{"key":"31_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/3-540-58431-5_8","volume-title":"Algebraic and Logic Programming","author":"M. Alpuente","year":"1994","unstructured":"Alpuente, M., Falaschi, M., Vidal, G.: Compositional Analysis for Equational Horn Programs. In: Rodr\u00edguez-Artalejo, M., Levi, G. (eds.) ALP 1994. LNCS, vol.\u00a0850, pp. 77\u201394. Springer, Heidelberg (1994)"},{"issue":"1-2","key":"31_CR6","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. Theor. Comput. Sci.\u00a0236(1-2), 133\u2013178 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"31_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"582","DOI":"10.1007\/3-540-55602-8_193","volume-title":"Automated Deduction - CADE-11","author":"J. Christian","year":"1992","unstructured":"Christian, J.: Some termination criteria for narrowing and e-narrowing. In: Kapur, D. (ed.) CADE 1992. LNCS, vol.\u00a0607, pp. 582\u2013588. Springer, Heidelberg (1992)"},{"issue":"1-2","key":"31_CR8","doi-asserted-by":"publisher","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.\u00a0367(1-2), 162\u2013202 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"31_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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 2005. LNCS, vol.\u00a03452, pp. 301\u2013331. Springer, Heidelberg (2005)"},{"key":"31_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/978-3-540-25979-4_15","volume-title":"Rewriting Techniques and Applications","author":"J. Giesl","year":"2004","unstructured":"Giesl, J., Thiemann, R., Schneider-Kamp, P., Falke, S.: Automated termination proofs with AProVe. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol.\u00a03091, pp. 210\u2013220. Springer, Heidelberg (2004)"},{"issue":"3","key":"31_CR11","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. J. Autom. Reasoning\u00a037(3), 155\u2013203 (2006)","journal-title":"J. Autom. Reasoning"},{"key":"31_CR12","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1016\/0743-1066(94)90034-5","volume":"19-20","author":"M. Hanus","year":"1994","unstructured":"Hanus, M.: The Integration of Functions into Logic Programming: From Theory to Practice. J. Log. Program.\u00a019-20, 583\u2013628 (1994)","journal-title":"J. Log. Program."},{"key":"31_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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":"31_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1007\/3-540-10009-1_25","volume-title":"5th Conference on Automated Deduction","author":"J.-M. Hullot","year":"1980","unstructured":"Hullot, J.-M.: Canonical Forms and Unification. In: Bibel, W. (ed.) CADE 1980. LNCS, vol.\u00a087, pp. 318\u2013334. Springer, Heidelberg (1980)"},{"key":"31_CR15","unstructured":"Kirchner, C., Kirchner, H., Santana de Oliveira, A.: Analysis of Rewrite-Based Access Control Policies. In: 3rd Int\u2019l Workshop on Security and Rewriting Techniques, SecreT 2008. ENTCS (to appear, 2008)"},{"issue":"1-2","key":"31_CR16","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/s10990-007-9000-6","volume":"20","author":"J. Meseguer","year":"2007","unstructured":"Meseguer, J., Thati, P.: Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols. Higher-Order and Symbolic Computation\u00a020(1-2), 123\u2013160 (2007)","journal-title":"Higher-Order and Symbolic Computation"},{"key":"31_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1007\/978-3-540-78769-3_2","volume-title":"Logic-Based Program Synthesis and Transformation","author":"M.T. Nguyen","year":"2008","unstructured":"Nguyen, M.T., Schneider-Kamp, P., de Schreye, D., Giesl, J.: Termination Analysis of Logic Programs based on Dependency Graphs. In: King, A. (ed.) LOPSTR 2007. LNCS, vol.\u00a04915, pp. 8\u201322. Springer, Heidelberg (2008)"},{"key":"31_CR18","unstructured":"Nishida, N., Miura, K.: Dependency graph method for proving termination of narrowing. In: 8th Int\u2019l Workshop on Termination, WST 2006 (2006)"},{"key":"31_CR19","doi-asserted-by":"crossref","unstructured":"Nishida, N., Sakai, M., Sakabe, T.: Narrowing-based simulation of term rewriting systems with extra variables. ENTCS\u00a086(3) (2003)","DOI":"10.1016\/S1571-0661(04)80693-5"},{"key":"31_CR20","unstructured":"Nishida, N., Vidal, G.: Termination of Narrowing via Termination of Rewriting (2008), http:\/\/www.dsic.upv.es\/~gvidal"},{"volume-title":"Term Rewriting Systems","year":"2003","key":"31_CR21","unstructured":"TeReSe (ed.): Term Rewriting Systems. Cambridge University Press, Cambridge (2003)"}],"container-title":["Lecture Notes in Computer Science","Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-89982-2_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,22]],"date-time":"2023-05-22T22:58:40Z","timestamp":1684796320000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-89982-2_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540899815","9783540899822"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-89982-2_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}