{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:10:39Z","timestamp":1725664239262},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540602996"},{"type":"electronic","value":"9783540447887"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60299-2_25","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T18:14:30Z","timestamp":1330280070000},"page":"415-430","source":"Crossref","is-referenced-by-count":1,"title":["Normalizing narrowing for weakly terminating and confluent systems"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Werner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"issue":"1&2","key":"25_CR1","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0747-7171(89)80021-5","volume":"8","author":"H.-J. B\u00fcckert","year":"1989","unstructured":"H.-J. B\u00fcckert, A. Herold and M. Schmidt-Schau\u00df. On Equational Theories, Unification and Decidability. Journal of Symbolic Computation, 1989, volume 8, number 1 & 2, 1989, Special issue on unification, part two, pages 3\u201350.","journal-title":"Journal of Symbolic Computation, 1989"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"A. Bockmayr, S. Krischer and A. Werner. An Optimal Narrowing Strategy for General Canonical Systems. In CTRS 1992, LNCS 656, Springer-Verlag, 1993.","DOI":"10.1007\/3-540-56393-8_39"},{"key":"25_CR3","unstructured":"A. Bockmayr, S. Krischer and A. Werner. Narrowing Strategies for Arbitrary Canonical Systems. Interner Bericht 22\/93, Fakult\u00e4t f\u00fcr Informatik, University of Karlsruhe, 1993. To appear in Fundamenta Informaticae."},{"key":"25_CR4","unstructured":"A. Bockmayr. Contributions to the Theory of Logic-Functional Programming. PhD thesis, Fakult\u00e4t f\u00fcr Informatik, Univ. Karlsruhe, 1990, (in German)."},{"key":"25_CR5","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, 1993, vol. 4, pages 147\u2013168.","journal-title":"Applicable Algebra in Engineering, Communication and Computing"},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"A. Bockmayr and A. Werner. LSE Narrowing for Decreasing Conditional Term Rewrite Systems. CTRS 1994, Jerusalem, Israel, 1994, to appear in LNCS.","DOI":"10.1007\/3-540-60381-6_4"},{"key":"25_CR7","unstructured":"G. Dowek, T. Hardin, C. Kirchner. Higher-order unification via explicit substitutions. Technical Report, December 1994. To appear in Proceedings Logic in Computer Science 1995."},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"N. Dershowitz and J.P. Jouannaud. Rewrite Systems, in: Handbook of Theoretical Computer Science, volume B, pages 244\u2013320, Elsevier, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"key":"25_CR9","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1016\/0743-1066(94)90034-5","volume":"19 & 20","author":"M. Hanus","year":"1994","unstructured":"M. Hanus. The Integration of Functions into Logic Programming: From Theory to Practice. J, of Logic Programming, 1994, vol. 19 & 20, pages 583\u2013628.","journal-title":"J, of Logic Programming"},{"key":"25_CR10","series-title":"LNCS 844","first-page":"370","volume-title":"Proceedings PLILP'94","author":"M. Hanus","year":"1994","unstructured":"M. Hanus. Combining Lazy Narrowing and Simplification. In Proceedings PLILP'94, 1994, Madrid, LNCS 844, Springer-Verlag, pages 370\u2013384."},{"key":"25_CR11","unstructured":"A. Herold. Narrowing Techniques Applied to Idempotent Unification. SEKI Report SR-86-16, Univ. Kaiserslautern, 1986."},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"G. Huet and D.C. Oppen. Equations and Rewrite Rules: A Survey. In R. Book (ed.), Formal Languages: Perspectives and Open Problems, Academic Press, 1980.","DOI":"10.1016\/B978-0-12-115350-2.50017-8"},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"S. H\u00f6lldobler: Foundations of Equational Logic Programming. LNAI 353, Springer-Verlag, 1989.","DOI":"10.1007\/BFb0015791"},{"key":"25_CR14","doi-asserted-by":"crossref","unstructured":"J. M. Hullot. Canonical Forms and Unification, Proceedings of the 5th CADE, 1980, LNCS 87, Springer-Verlag, page 318\u2013334.","DOI":"10.21236\/ADA087640"},{"key":"25_CR15","series-title":"LNCS 154","first-page":"361","volume-title":"Incremental Construction of Unification Algorithms in Equational Theories","author":"J.P. Jouannaud","year":"1983","unstructured":"J.P. Jouannaud, C. Kirchner and H. Kirchner. Incremental Construction of Unification Algorithms in Equational Theories. In Proc. 10th ICALP, Barcelona, LNCS 154, Springer-Verlag, 1983, pages 361\u2013373."},{"key":"25_CR16","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-Background: Computational Structures, pages 1\u2013116. Oxford Uni. Press, 1992."},{"key":"25_CR17","doi-asserted-by":"crossref","unstructured":"R. Loogen and S. Winkler. Dynamic Detection of Determinism in Functional Logic Languages. In Proc. 3th PLILP, 1991, LNCS 528, Springer-Verlag, pages 335\u2013346.","DOI":"10.1007\/3-540-54444-5_110"},{"key":"25_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, 1994, volume 5, pages 213\u2013253.","journal-title":"Applicable Algebra in Engineering, Communication and Computing"},{"key":"25_CR19","series-title":"LNCS 256","first-page":"228","volume-title":"Proc. 2nd RTA","author":"P. R\u00e9ty","year":"1987","unstructured":"P. R\u00e9ty. Improving Basic Narrowing Techniques. In Proc. 2nd RTA, Bordeaux, LNCS 256, Springer-Verlag, 1987, pages 228\u2013241."},{"key":"25_CR20","unstructured":"P. R\u00e9ty. M\u00e9thodes d'unification par surr\u00e9duction. PhD thesis, Univ. Nancy, 1988."},{"key":"25_CR21","unstructured":"A. Werner. Normalizing Narrowing for Weakly Terminating and Confluent Systems. Interner Bericht. Fak. f. Informatik, Univ. Karlsruhe, in preparation."},{"key":"25_CR22","doi-asserted-by":"crossref","unstructured":"A. Yamamoto. Completeness of Extended Unification Based on Basic Narrowing. In Proc. 7th Logic Programming Conference, Jerusalem, pages 1\u201310, 1988.","DOI":"10.1007\/3-540-51564-X_51"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2014 CP '95"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60299-2_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:57:56Z","timestamp":1605646676000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60299-2_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540602996","9783540447887"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-60299-2_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}