{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:13:16Z","timestamp":1725664396231},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540603818"},{"type":"electronic","value":"9783540455134"}],"license":[{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"content-version":"tdm","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":[[1995]]},"DOI":"10.1007\/3-540-60381-6_4","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T18:23:31Z","timestamp":1330280611000},"page":"51-70","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["LSE narrowing for decreasing conditional term rewrite systems"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Bockmayr","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Werner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,25]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"S. Antoy, R. Echahed, and M. Hanus. A needed narrowing strategy. In 21st ACM Symposium on Principles of Programming Languages, POPL '94, Portland, pages 268\u2013279, 1994.","DOI":"10.1145\/174675.177899"},{"key":"4_CR2","unstructured":"A. Bockmayr. Contributions to the Theory of Logic-Functional Programming. PhD thesis, Fakult\u00e4t f\u00fcr Informatik, Univ. Karlsruhe, 1990. (in German)."},{"issue":"3","key":"4_CR3","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF01202035","volume":"4","author":"A. Bockmayr","year":"1993","unstructured":"A. Bockmayr. Conditional narrowing modulo a set of equations. Applicable Algebra in Engineering, Communication and Computing, 4(3):147\u2013168, 1993.","journal-title":"Applicable Algebra in Engineering, Communication and Computing"},{"key":"4_CR4","volume-title":"LNCS 656","author":"A. Bockmayr","year":"1992","unstructured":"A. Bockmayr, S. Krischer, and A. Werner. An optimal narrowing strategy for general canonical systems. In Conditional Term Rewriting Systems, CTRS'92, Pont-\u00e0-Mousson, France. Springer, LNCS 656, 1992."},{"key":"4_CR5","volume-title":"Technical Report MPI-I-93-233","author":"A. Bockmayr","year":"1993","unstructured":"A. Bockmayr, S. Krischer, and A. Werner. Narrowing strategies for arbitrary canonical systems. Technical Report MPI-I-93-233, Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, July 1993. To appear in Fundamenta Informaticae."},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In Jan van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B: Formal Models and Semantics, chapter 6, pages 244\u2013320. Elsevier, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"key":"4_CR7","volume-title":"Logic programming cum applicative programming","author":"N. Dershowitz","year":"1985","unstructured":"N. Dershowitz and D. A. Plaisted. Logic programming cum applicative programming. In Proc. Intern. Symposium on Logic Programming, Boston. IEEE, 1985."},{"key":"4_CR8","unstructured":"M. Fay. First-order unification in an equational theory. In 4th Workshop on Automated Deduction, Austin, Texas, 1979."},{"key":"4_CR9","unstructured":"E. Giovannetti and C. Moiso. A completeness result for E-unification algorithms based on conditional narrowing. In Foundations of Logic and Functional Programming, Trento. Springer LNCS 306, 1986."},{"key":"4_CR10","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1016\/0743-1066(94)90034-5","volume":"19","author":"M. Hanus","year":"1994","unstructured":"M. Hanus. The integration of functions into logic programming: From theory to practice. Journal of Logic Programming, 19&20:583\u2013628, 1994.","journal-title":"Journal of Logic Programming"},{"key":"4_CR11","unstructured":"A. Herold. Narrowing techniques applied to idempotent unification. SEKI-Report SR-86-16, Univ. Kaiserslautern, 1986."},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"G. Huet and D. C. Oppen. Equations and rewrite rules, A survey. In R. V. Book, editor, Formal Language Theory. Academic Press, 1980.","DOI":"10.1016\/B978-0-12-115350-2.50017-8"},{"key":"4_CR13","volume-title":"LNCS 87","author":"J. M. Hullot","year":"1980","unstructured":"J. M. Hullot. Canonical forms and unification. In Proc. 5th Conference on Automated Deduction, Les Arcs. Springer, LNCS 87, 1980."},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"H. Hu\\mann. Unification in conditional-equational theories. Technical Report MIP-8502, Univ. Passau, Jan. 1985. Short version: EUROCAL 85, Linz, Springer, LNCS 204.","DOI":"10.1007\/3-540-15984-3_328"},{"key":"4_CR15","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0304-3975(84)90087-2","volume":"33","author":"S. Kaplan","year":"1984","unstructured":"S. Kaplan. Conditional rewrite rules. Theoretical Computer Science, 33:175\u2013193, 1984.","journal-title":"Theoretical Computer Science"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"S. Kaplan. Fair conditional term rewriting systems: Unification, termination and confluence. Technical Report 194, L. R. I., Univ. Paris-Sud, 1984.","DOI":"10.1007\/978-3-662-09691-8_11"},{"key":"4_CR17","unstructured":"J. W. Klop. Term rewriting systems. In S. Abramski, D. M. Gabbay, and T. S. Maibaum, editors, Handbook of Logic in Computer Science, volume 2 \u2014 Background: Computational Structures, pages 1\u2013116. Oxford Univ. Press, 1992."},{"key":"4_CR18","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/BF01190830","volume":"5","author":"A. Middeldorp","year":"1994","unstructured":"A. Middeldorp and E. 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"},{"key":"4_CR19","volume-title":"LNCS 256","author":"P. R\u00e9ty","year":"1987","unstructured":"P. R\u00e9ty. Improving basic narrowing techniques. In Proc. Rewriting Techniques and Applications RTA '87, Bordeaux. Springer, LNCS 256, 1987."},{"key":"4_CR20","unstructured":"A. Werner, A. Bockmayr, and S. Krischer. How to realize LSE narrowing. Technical Report 6\/93, Fakult\u00e4t f\u00fcr Informatik, Univ. Karlsruhe, December 1993."},{"key":"4_CR21","first-page":"59","volume-title":"LNCS 850","author":"A. Werner","year":"1994","unstructured":"A. Werner, A. Bockmayr, and S. Krischer. How to realize LSE narrowing. In Algebraic and Logic Programming, ALP'94, Madrid, pages 59\u201376. Springer, LNCS 850, 1994."}],"container-title":["Lecture Notes in Computer Science","Conditional and Typed Rewriting Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60381-6_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T12:54:15Z","timestamp":1558270455000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60381-6_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540603818","9783540455134"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-60381-6_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]},"assertion":[{"value":"25 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}