{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:27:39Z","timestamp":1761611259612,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540662464"},{"type":"electronic","value":"9783540484837"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48483-3_11","type":"book-chapter","created":{"date-parts":[[2010,3,29]],"date-time":"2010-03-29T21:13:32Z","timestamp":1269897212000},"page":"152-167","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Complete Strategies for Term Graph Narrowing"],"prefix":"10.1007","author":[{"given":"Annegret","family":"Habel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Detlef","family":"Plump","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,5,27]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Sergio Antoy, Rachid Echahed, and Michael Hanus. A needed narrowing strategy. In Proc. Symposium on Principles of Programming Languages, pages 268\u2013279. ACM Press, 1994.","DOI":"10.1145\/174675.177899"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Franz Baader and Tobias Nipkow. Term Rewriting and All That. Cambridge University Press, 1998.","DOI":"10.1017\/CBO9781139172752"},{"key":"11_CR3","unstructured":"Franz Baader and J\u00f6org H. Siekmann. Unification theory. In D.M. Gabbay, C.J. Hogger, and J.A. Robinson, editors, Handbook of Logic in Articial Intelligence and Logic Programming, pages 41\u2013125. Clarendon Press, 1994."},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Alexander Bockmayr, Stefan Krischer, and Andreas Werner. Narrowing strategies for arbitrary canonical rewrite systems. Fundamenta Informaticae, 24:125\u2013155, 1995.","DOI":"10.3233\/FI-1995-24126"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Nachum Dershowitz and Jean-Pierre Jouannaud. Rewrite systems. In Jan van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, chapter 6, pages 244\u2013320. Elsevier, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Rachid Echahed and Jean-Christophe Janodet. Admissible graph rewriting and narrowing. In Proc. Joint International Conference and Symposium on Logic Programming 1998. MIT Press, 1998.","DOI":"10.1007\/3-540-48483-3_9"},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1017\/S0960129500070122","volume":"6","author":"A. Habel","year":"1996","unstructured":"Annegret Habel and Detlef Plump. Term graph narrowing. Mathematical Structures in Computer Science, 6:649\u2013676, 1996.","journal-title":"Mathematical Structures in Computer Science"},{"key":"11_CR8","unstructured":"Annegret Habel and Detlef Plump. Completeness of narrowing in non-copying implementations. Informatik-Bericht 19\/97, Universit\u00e4t Hildesheim, Institut f\u00fcr Informatik, 1997."},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1016\/0743-1066(94)90034-5","volume":"19 & 20","author":"M. Hanus","year":"1994","unstructured":"Michael Hanus. The integration of functions into logic programming: From theory to practice. The Journal of Logic Programming, 19 & 20:583\u2013628, 1994.","journal-title":"The Journal of Logic Programming"},{"issue":"2\u20134","key":"11_CR10","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/S0096-0551(97)00010-6","volume":"23","author":"M. Hanus","year":"1997","unstructured":"Michael Hanus. Lazy narrowing with simplication. Journal of Computer Languages, 23(2\u20134):61\u201385, 1997.","journal-title":"Journal of Computer Languages"},{"key":"11_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1007\/3-540-10009-1_25","volume-title":"Proc. 5th International Conference on Automated Deduction","author":"J.-M. Hullot","year":"1980","unstructured":"Jean-Marie Hullot. Canonical forms and unication. In Proc. 5th International Conference on Automated Deduction, volume 87 of Lecture Notes in Computer Science, pages 318\u2013334. Springer-Verlag, 1980."},{"key":"11_CR12","unstructured":"Jean-Pierre Jouannaud and Claude Kirchner. Solving equations in abstract algebras: A rule-based survey of unification. In Jean-Louis Lassez and Gordon Plotkin, editors, Computational Logic: Essays in Honor of Alan Robinson, pages 257\u2013321. MIT Press, 1991."},{"key":"11_CR13","unstructured":"Jan Willem Klop. Term rewriting systems. In S. Abramsky, Dov M. Gabbay, and T.S.E. Maibaum, editors, Handbook of Logic in Computer Science, volume 2, pages 1\u2013116. Oxford University Press, 1992."},{"key":"11_CR14","unstructured":"Madala R.K. Krishna Rao. Completeness results for basic narrowing in non-copying implementations. In Proc. Int. Joint Conference and Symposium on Logic Programming. MIT Press, 1996."},{"key":"11_CR15","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/BF01190830","volume":"5","author":"A. Middeldorp","year":"1994","unstructured":"Aart Middeldorp and Erik Hamoen. Completeness results for basic narrowing. Applicable Algebra in Engineering, Communication and Computing, 5:213\u2013253, 1994.","journal-title":"Applicable Algebra in Engineering, Communication and Computing"},{"issue":"12","key":"11_CR16","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0304-3975(96)00071-0","volume":"167","author":"A. Middeldorp","year":"1996","unstructured":"Aart Middeldorp, Satoshi Okui, and Tetsuo Ida. Lazy narrowing: Strong completeness and eager variable elimination. Theoretical Computer Science, 167(1,2):95\u2013130, 1996.","journal-title":"Theoretical Computer Science"},{"key":"11_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/3-540-56393-8_7","volume-title":"Proc. Conditional Term Rewriting Systems","author":"D. Plump","year":"1993","unstructured":"Detlef Plump. Collapsed tree rewriting: Completeness, confluence, and modularity. In Proc. Conditional Term Rewriting Systems, volume 656 of Lecture Notes in Computer Science, pages 97\u2013112. Springer-Verlag, 1993."},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"Detlef Plump. Term graph rewriting. In H. Ehrig, G. Engels, H.-J. Kreowski, and G. Rozenberg, editors, Handbook of Graph Grammars and Computing by Graph Transformation, volume 2. World Scientific, 1998. To appear.","DOI":"10.1142\/9789812815149_0001"},{"key":"11_CR19","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1007\/3-540-60299-2_25","volume-title":"Proc. Principles and Practice of Constraint Programming","author":"A. Werner","year":"1995","unstructured":"Andreas Werner. Normalizing narrowing for weakly terminating and confluent systems. In Proc. Principles and Practice of Constraint Programming, volume 976 of Lecture Notes in Computer Science, pages 415\u2013430. Springer-Verlag, 1995."},{"key":"11_CR20","doi-asserted-by":"crossref","unstructured":"Akihiro Yamamoto. Completeness of extended unification based on basic narrowing. In Proc. Logic Programming \u201988, volume 383 of Lecture Notes in Articial Intelligence, pages 1\u201310. Springer-Verlag, 1989.","DOI":"10.1007\/3-540-51564-X_51"}],"container-title":["Lecture Notes in Computer Science","Recent Trends in Algebraic Development Techniques"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48483-3_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,31]],"date-time":"2023-05-31T09:52:37Z","timestamp":1685526757000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48483-3_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540662464","9783540484837"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-48483-3_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"27 May 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}