{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:58:31Z","timestamp":1725663511852},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540563938"},{"type":"electronic","value":"9783540475491"}],"license":[{"start":{"date-parts":[[1993,1,1]],"date-time":"1993-01-01T00:00:00Z","timestamp":725846400000},"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":[[1993]]},"DOI":"10.1007\/3-540-56393-8_39","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T06:08:10Z","timestamp":1330236490000},"page":"483-497","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["An optimal narrowing strategy for general canonical systems"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Bockmayr","sequence":"first","affiliation":[]},{"given":"Stefan","family":"Krischer","sequence":"additional","affiliation":[]},{"given":"Andreas","family":"Werner","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"39_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0304-3975(88)90095-3","volume":"59","author":"P. G. Bosco","year":"1988","unstructured":"P. G. Bosco, E. Giovannetti, and C. Moiso. Narrowing vs. SLD-Resolution. Theoretical Computer Science, 59:3\u201323, 1988.","journal-title":"Theoretical Computer Science"},{"key":"39_CR2","unstructured":"A. Bockmayr. Narrowing with inductively defined functions. Technical Report 25\/86, Fakult\u00e4t f\u00fcr Informatik, Univ. Karlsruhe, 1986."},{"key":"39_CR3","series-title":"LNCS 343","volume-title":"First Int. Workshop Algebraic and Logic Programming","author":"A. Bockmayr","year":"1988","unstructured":"A. Bockmayr. Narrowing with built-in theories. In First Int. Workshop Algebraic and Logic Programming, Gau\u03b2ig. Springer, LNCS 343, 1988."},{"key":"39_CR4","series-title":"LNCS 355","volume-title":"Proc. Rewriting Techniques and Applications","author":"J. Darlington","year":"1989","unstructured":"J. Darlington and Y. Guo. Narrowing and unification in functional programming \u2014 an evaluation mechanism for absolute set abstraction. In Proc. Rewriting Techniques and Applications, Chapel Hill. Springer, LNCS 355, 1989."},{"key":"39_CR5","series-title":"LNCS 299","volume-title":"Proc. CAAP88","author":"R. Echahed","year":"1988","unstructured":"R. Echahed. On completeness of narrowing strategies. In Proc. CAAP88, Nancy. Springer, LNCS 299, 1988."},{"key":"39_CR6","unstructured":"M. Fay. First-order unification in an equational theory. In 4th Workshop on Automated Deduction, Austin, Texas, 1979."},{"key":"39_CR7","series-title":"LNCS 202","volume-title":"Proc. Rewriting Techniques and Applications","author":"L. Fribourg","year":"1985","unstructured":"L. Fribourg. Handling function definitions through innermost superposition and rewriting. In Proc. Rewriting Techniques and Applications, Dijon. Springer, LNCS 202, 1985."},{"key":"39_CR8","unstructured":"A. Herold. Narrowing techniques applied to idempotent unification. SEKI-Report SR-86-16, Univ. Kaiserslautern, 1986."},{"key":"39_CR9","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":"39_CR10","doi-asserted-by":"crossref","unstructured":"S. H\u00f6lldobler. Foundations of Equational Logic Programming. Springer, LNCS 353, 1989.","DOI":"10.1007\/BFb0015791"},{"key":"39_CR11","series-title":"LNCS 87","volume-title":"Proc. 5th Conference on Automated Deduction","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":"39_CR12","doi-asserted-by":"crossref","unstructured":"S. Krischer and A. Bockmayr. Detecting redundant narrowing derivations by the LSE-SL reducibility test. In Proc. Rewriting Techniques and Applications, Como. Springer, LNCS 488, 1991.","DOI":"10.1007\/3-540-53904-2_87"},{"key":"39_CR13","unstructured":"S. Krischer. Vergleich und Bewertung von Narrowing-Strategien. Diplomarbeit, Fakult\u00e4t f\u00fcr Informatik, Univ. Karlsruhe, 1990."},{"key":"39_CR14","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/S0747-7171(89)80014-8","volume":"7","author":"W. Nutt","year":"1989","unstructured":"W. Nutt, P. R\u00e9ty, and G. Smolka. Basic narrowing revisited. Journal of Symbolic Computation, 7:295\u2013317, 1989.","journal-title":"Journal of Symbolic Computation"},{"key":"39_CR15","doi-asserted-by":"crossref","unstructured":"P. Padawitz. Computing in Horn Clause Theories, volume 16 of EATCS Monograph. Springer, 1988.","DOI":"10.1007\/978-3-642-73824-1"},{"key":"39_CR16","series-title":"LNCS 256","volume-title":"Proc. Rewriting Techniques and Applications","author":"P. R\u00e9ty","year":"1987","unstructured":"P. R\u00e9ty. Improving basic narrowing techniques. In Proc. Rewriting Techniques and Applications, Bordeaux. Springer, LNCS 256, 1987."},{"key":"39_CR17","unstructured":"P. R\u00e9ty. M\u00e9thodes d'Unification par Surr\u00e9duction. PhD thesis, Univ. Nancy, 1988."},{"key":"39_CR18","series-title":"LNCS 202","volume-title":"Proc. Rewriting Techniques and Applications","author":"P. R\u00e9ty","year":"1985","unstructured":"P. R\u00e9ty, C. Kirchner, H. Kirchner, and P. Lescanne. NARROWER: a new algorithm for unification and its application to logic programming. In Proc. Rewriting Techniques and Applications, Dijon. Springer, LNCS 202, 1985."},{"key":"39_CR19","unstructured":"A. Werner. Termersetzung und Narrowing mit geordneten Sorten. Diplomarbeit, Fakult\u00e4t f\u00fcr Informatik, Univ. Karlsruhe, 1991."},{"key":"39_CR20","series-title":"LNGS 343","volume-title":"First Int. Workshop Algebraic and Logic Programming","author":"J. You","year":"1988","unstructured":"J. You. Solving equations in an equational language. In First Int. Workshop Algebraic and Logic Programming, Gau\u00dfig. Springer, LNGS 343, 1988."},{"key":"39_CR21","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/0022-0000(91)90039-8","volume":"42","author":"J. You","year":"1991","unstructured":"J. You. Unification modulo an equality theory for equational logic programming. J. Comp. Syst. Sc., 42:54\u201375, 1991.","journal-title":"J. Comp. Syst. Sc."}],"container-title":["Lecture Notes in Computer Science","Conditional Term Rewriting Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56393-8_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T08:36:45Z","timestamp":1558255005000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56393-8_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540563938","9783540475491"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-56393-8_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]},"assertion":[{"value":"30 May 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}