{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,18]],"date-time":"2026-04-18T23:02:38Z","timestamp":1776553358133,"version":"3.51.2"},"publisher-location":"Berlin\/Heidelberg","reference-count":34,"publisher":"Springer-Verlag","isbn-type":[{"value":"354055873X","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0013830","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T07:24:11Z","timestamp":1132730651000},"page":"244-258","source":"Crossref","is-referenced-by-count":15,"title":["Counterexamples to completeness results for basic narrowing (extended abstract)"],"prefix":"10.1007","author":[{"given":"Aart","family":"Middeldorp","sequence":"first","affiliation":[]},{"given":"Erik","family":"Hamoen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"16_CR1","first-page":"323","volume":"32","author":"J.A. Bergstra","year":"1986","unstructured":"J.A. Bergstra and J.W. Klop, Conditional Rewrite Rules: Confluence and Termination. JCSS 32(3), pp. 323\u2013362, 1986.","journal-title":"JCSS"},{"key":"16_CR2","unstructured":"A. Bockmayr, Beitr\u00e4ge nur Theorie des Logisch-Funktionalen Programmierens, Ph.D. thesis, Universit\u00e4t Karlsruhe, 1990. (In German.)"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"P.G. Bosco, E. Giovannetti and C. Moiso, Refined Strategies for Semantic Unification, Proceedings TAPSOFT'87, Pisa, LNCS 250, pp. 276\u2013290, 1987.","DOI":"10.1007\/BFb0014986"},{"key":"16_CR4","doi-asserted-by":"crossref","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, TCS 59, pp. 3\u201323, 1988.","journal-title":"TCS"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"J. Chabin and P. R\u00e9ty, Narrowing Directed by a Graph of Terms, Proceedings RTA'91, Como, LNCS 488, pp. 112\u2013123, 1991.","DOI":"10.1007\/3-540-53904-2_90"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"N. Dershowitz and J.-P. Jouannaud, Rewrite Systems, in: \u201cHandbook of Theoretical Computer Science, Vol. B\u201d (ed. J. van Leeuwen), North-Holland, pp. 243\u2013320, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"key":"16_CR7","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0304-3975(90)90064-O","volume":"75","author":"N. Dershowitz","year":"1990","unstructured":"N. Dershowitz and M. Okada, A Rationale for Conditional Equational Programming, TCS 75, pp. 111\u2013138, 1990.","journal-title":"TCS"},{"key":"16_CR8","first-page":"31","volume-title":"Proceedings CTRS'87","author":"N. Dershowitz","year":"1987","unstructured":"N. Dershowitz, M. Okada and G. Sivakumar, Confluence of Conditional Rewrite Systems, Proceedings CTRS'87, Orsay, LNCS 308, pp. 31\u201344, 1987."},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"N. Dershowitz, M. Okada and G. Sivakumar, Canonical Conditional Rewrite Systems, Proceedings CADE'88, Argonne. LNCS 310, pp. 538\u2013549, 1988.","DOI":"10.1007\/BFb0012855"},{"key":"16_CR10","unstructured":"N. Dershowitz and D.A. Plaisted, Logic Programming cum Applicative Programming, Proceedings SLP'85, Boston, pp. 54\u201366, 1985."},{"key":"16_CR11","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0304-3975(90)90032-D","volume":"72","author":"R. Echahed","year":"1990","unstructured":"R. Echahed, On Completeness of Narrowing Strategies, TCS 72, pp. 133\u2013146, 1990.","journal-title":"TCS"},{"key":"16_CR12","unstructured":"M. Fay, First-Order Unification in Equational Theories, Proceedings CADE'79, Austin, pp. 161\u2013167, 1979."},{"key":"16_CR13","unstructured":"L. Fribourg. SLOG: A Logic Programming Language Interpreter based on Clausal Superposition and Rewriting. Proceedings SLP'85, Boston, pp. 172\u2013184, 1985."},{"key":"16_CR14","first-page":"139","volume":"42","author":"E. Giovannetti","year":"1991","unstructured":"E. Giovannetti, G. Levi, C. Moiso and C. Palamidessi, Kernel-LEAF: A Logic plus Functional Language, JCSS 42, pp. 139\u2013185, 1991.","journal-title":"JCSS"},{"key":"16_CR15","first-page":"157","volume-title":"A Completeness Result for E-Unification Algorithms based on Conditional Narrowing","author":"E. Giovannetti","year":"1986","unstructured":"E. Giovannetti and C. Moiso, A Completeness Result for E-Unification Algorithms based on Conditional Narrowing, Proceedings of the Workshop on Foundations of Logic and Functional Programming, Trento, LNCS 306, pp. 157\u2013167, 1986."},{"key":"16_CR16","first-page":"387","volume-title":"Compiling Logic Programs with Equality","author":"M. Hanus","year":"1990","unstructured":"M. Hanus, Compiling Logic Programs with Equality, Proceedings of the International Workshop on Language Implementation and Logic Programming, Link\u00f6ping, LNCS 456. pp. 387\u2013401, 1990."},{"key":"16_CR17","unstructured":"A. Herold, Combination of Unification Algorithms in Equational Theories, Ph.D. thesis, Universit\u00e4t Kaiserslautern, 1987."},{"key":"16_CR18","unstructured":"G. Huet and J.J. L\u00e9vy, Call by Need Computations in Non-Ambiguous Linear Term Rewriting Systems, Report 359, INRIA, 1979."},{"key":"16_CR19","doi-asserted-by":"crossref","unstructured":"S. H\u00f6lldobler, Foundations of Equational Logic Programming. LNAI 353, 1989.","DOI":"10.1007\/BFb0015791"},{"key":"16_CR20","doi-asserted-by":"crossref","unstructured":"J.-M. Hullot, Canonical Forms and Unification, Proceedings CADE'80, LNCS 87, pp. 318\u2013334. 1980.","DOI":"10.21236\/ADA087640"},{"key":"16_CR21","volume-title":"Th\u00e8se de troisi\u00e8me cycle","author":"J.-M. Hullot","year":"1980","unstructured":"J.-M. Hullot, Compilation de Formes Canoniques dans les Th\u00e9ories Equationelles, Th\u00e8se de troisi\u00e8me cycle, Universit\u00e9 de Paris Sud, Orsay, 1980. (In French)."},{"key":"16_CR22","doi-asserted-by":"crossref","unstructured":"H. Hu\u00dfmann, Unification in Conditional-Equational Theories. Proceedings EUROCAL'85, LNCS 204, pp. 543\u2013553, 1985.","DOI":"10.1007\/3-540-15984-3_328"},{"issue":"3","key":"16_CR23","first-page":"295","volume":"4","author":"S. Kaplan","year":"1987","unstructured":"S. Kaplan, Simplifying Conditional Term Rewriting Systems: Unification, Termination and Confluence, JSC 4(3), pp. 295\u2013334. 1987.","journal-title":"JSC"},{"key":"16_CR24","unstructured":"C. Kirchner, M\u00e9thodes et Outils de Conception Syst\u00e9matique d'Algorithmes d'Unification dans les Th\u00e9ories Equationelles, Th\u00e8se de d'\u00e9tat, Universit\u00e9 de Nancy I, 1985. (In French)."},{"key":"16_CR25","doi-asserted-by":"crossref","unstructured":"J.W. Klop, Term Rewriting Systems: from Church-Rosser to Knuth-Bendix and beyond, Proceedings ICALP'90, Warwick, LNCS 443, pp. 350\u2013369, 1990.","DOI":"10.1007\/BFb0032044"},{"key":"16_CR26","series-title":"Handbook of Logic in Computer Science, Vol. I","volume-title":"Report CS-R9073","author":"J.W. Klop","year":"1991","unstructured":"J.W. Klop, Term Rewriting Systems, Report CS-R9073, CWI, Amsterdam. To appear in: \u201cHandbook of Logic in Computer Science, Vol. I\u201d (eds. S. Abramsky, D. Gabbay, T. Maibaum), Oxford University Press, 1991."},{"key":"16_CR27","doi-asserted-by":"crossref","unstructured":"S. Krischer and A. Bockmayr, Detecting Redundant Narrowing Derivations by the LSE-SL Reducibility Test, Proceedings RTA'91, Como, LNCS 488, pp. 74\u201385,1991.","DOI":"10.1007\/3-540-53904-2_87"},{"key":"16_CR28","unstructured":"Corrado Moiso, personal communication, August 1991."},{"key":"16_CR29","doi-asserted-by":"crossref","unstructured":"J.J. Moreno-Navarro and M. Rodr\u00edguez-Artalejo. BABEL: A Functional and Logic Programming Language based on Constructor Discipline and Narrowing, Proceedings ALP'89, Gau\u00dfig. LNCS 343, pp. 223\u2013232, 1989.","DOI":"10.1007\/3-540-50667-5_74"},{"key":"16_CR30","first-page":"295","volume":"7","author":"W. Nutt","year":"1989","unstructured":"W. Nutt, P. R\u00e9ty and G. Smolka, Basic Narrowing Revisited, JSC 7, pp. 295\u2013317, 1989.","journal-title":"JSC"},{"key":"16_CR31","unstructured":"Catuscia Palamidessi. personal communication, July 1991."},{"key":"16_CR32","doi-asserted-by":"crossref","unstructured":"P. R\u00e9ty, Improving Basic Narrowing Techniques, Proceedings RTA'87, Bordeaux, LNCS 256, pp. 228\u2013241, 1987.","DOI":"10.1007\/3-540-17220-3_20"},{"key":"16_CR33","doi-asserted-by":"crossref","unstructured":"A. Yamamoto, Completeness of Extended Unification Based on Basic Narrowing, Proceedings LPC'88, Jerusalem, pp. 1\u201310, 1988.","DOI":"10.1007\/3-540-51564-X_51"},{"key":"16_CR34","first-page":"319","volume":"7","author":"Y.H. You","year":"1989","unstructured":"Y.H. You, Enumerating Outer Narrowing Derivations for Constructor Based Term Rewriting Systems, JSC 7, pp. 319\u2013343, 1989.","journal-title":"JSC"}],"container-title":["Lecture Notes in Computer Science","Algebraic and Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0013830","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T04:33:28Z","timestamp":1586579608000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0013830"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354055873X"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/bfb0013830","relation":{},"subject":[]}}