{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,8]],"date-time":"2025-11-08T17:36:34Z","timestamp":1762623394262},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540571865"},{"type":"electronic","value":"9783540479451"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57186-8_93","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T07:14:51Z","timestamp":1330240491000},"page":"391-409","source":"Crossref","is-referenced-by-count":7,"title":["Narrowing approximations as an optimization for equational logic programs"],"prefix":"10.1007","author":[{"given":"Mar\u00eda","family":"Alpuente","sequence":"first","affiliation":[]},{"given":"Moreno","family":"Falaschi","sequence":"additional","affiliation":[]},{"given":"Mar\u00eda Jos\u00e9","family":"Ramis","sequence":"additional","affiliation":[]},{"given":"Germ\u00e1n","family":"Vidal","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"27_CR1","series-title":"volume 516 of Lecture Notes in Computer Science","first-page":"416","volume-title":"Proc. of CTRS'90","author":"G. Aguzzi","year":"1990","unstructured":"G. Aguzzi, U. Modigliani, and M.C. Verri. A Universal Unification Condition for Solving Goals in Equational Languages. In Proc. of CTRS'90, volume 516 of Lecture Notes in Computer Science, pages 416\u2013423. Springer-Verlag, Berlin, 1990."},{"key":"27_CR2","unstructured":"H. A\u00eft-Kaci, P. Lincoln, and R. Nasr. Le Fun: Logic, equations, and Functions. In Proc. of the Fourth IEEE Symposium on Logic Programming, pages 17\u201323. IEEE Computer Society Press, 1987."},{"key":"27_CR3","unstructured":"M. Alpuente, M. Falaschi, and G. Levi. Incremental Constraint Satisfaction for Equational Logic Programming. Technical Report TR-20\/91, Dipartimento di Informatica, Universit\u00e0 di Pisa, 1991. to appear in Theoretical Computer Science."},{"key":"27_CR4","first-page":"443","volume-title":"volume 631 of Lecture Notes in Computer Science","author":"M. Alpuente","year":"1992","unstructured":"M. Alpuente, M. Falaschi, and F. Manzo. Analyses of Inconsistency for Incremental Equational Logic Programming. In M. Bruynooghe and M. Wirsing, editors, Proc. of PLILP'92, Leuven (Belgium), volume 631 of Lecture Notes in Computer Science, pages 443\u2013457. Springer-Verlag, Berlin, 1992."},{"key":"27_CR5","unstructured":"M. Alpuente, M. Falaschi, and F. Manzo. Analyses of Unsatisfiability for Equational Logic Programming. Technical Report DSIC-II\/29\/92, UPV, 1992. submitted for publication."},{"key":"27_CR6","doi-asserted-by":"crossref","unstructured":"M. Alpuente, M. Falaschi, M.J. Ramis, and G. Vidal. Narrowing Aproximations as an optimization for Equational Logic Programs. Technical Report DSIC-II\/1\/93, Departamento de Sistemas Inform\u00e1ticos y Computaci\u00f3n, Universidad Polit\u00e9cnica de Valencia, 1993.","DOI":"10.1007\/3-540-57186-8_93"},{"key":"27_CR7","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0304-3975(88)90095-3","volume":"59","author":"P. Bosco","year":"1988","unstructured":"P. Bosco, E. Giovannetti, and C. Moiso. Narrowing vs. SLD-resolution. Theoretical Computer Science, 59:3\u201323, 1988.","journal-title":"Theoretical Computer Science"},{"key":"27_CR8","series-title":"volume 488 of Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1007\/3-540-53904-2_90","volume-title":"Proc. of RTA '91","author":"J. Chabin","year":"1991","unstructured":"J. Chabin and P. R\u00e9ty. Narrowing directed by a graph of terms. In G. Goos and J. Hartmanis, editors, Proc. of RTA '91, volume 488 of Lecture Notes in Computer Science, pages 112\u2013123. Springer-Verlag, Berlin, 1991."},{"key":"27_CR9","first-page":"582","volume-title":"volume 607 of Lecture Notes in Computer Science","author":"J. Christian","year":"1992","unstructured":"J. Christian. Some termination criteria for narrowing and E-narrowing. In 11th Int'l Conf. on Automated Deduction, volume 607 of Lecture Notes in Computer Science, pages 582\u2013588. Springer-Verlag, Berlin, 1992."},{"key":"27_CR10","first-page":"331","volume-title":"Proc. Eighth Int'l Conf. on Logic Programming","author":"M. Codish","year":"1991","unstructured":"M. Codish, M. Falaschi, and K. Marriott. Suspension Analysis for Concurrent Logic Programs. In K. Furukawa, editor, Proc. Eighth Int'l Conf. on Logic Programming, pages 331\u2013345. The MIT Press, Cambridge, Mass., 1991."},{"key":"27_CR11","series-title":"volume B: Formal Models and Semantics","first-page":"243","volume-title":"Handbook of Theoretical Computer Science","author":"N. Dershowitz","year":"1990","unstructured":"N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B: Formal Models and Semantics, pages 243\u2013320. Elsevier, Amsterdam and The MIT Press, Cambridge, 1990."},{"key":"27_CR12","first-page":"45","volume-title":"volume 308 of Lecture Notes in Computer Science","author":"N. Dershowitz","year":"1987","unstructured":"N. Dershowitz and G. Sivakumar. Solving Goals in Equational Languages. In S. Kaplan and J. Joaunnaud, editors, Proc. First Int'l Workshop on Conditional Term Rewriting, volume 308 of Lecture Notes in Computer Science, pages 45\u201355. Springer-Verlag, Berlin, 1987."},{"key":"27_CR13","unstructured":"L. Fribourg. Slog: a logic programming language interpreter based on clausal superposition and rewriting. In Proc. Second IEEE Int'l Symp. on Logic Programming, pages 172\u2013185. IEEE, 1985."},{"key":"27_CR14","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0743-1066(89)90028-9","volume":"6","author":"J.H. Gallier","year":"1989","unstructured":"J.H. Gallier and S. Raatz. Extending SLD-resolution to equational Horn clauses using E-unification. Journal of Logic Programming, 6:3\u201343, 1989.","journal-title":"Journal of Logic Programming"},{"key":"27_CR15","series-title":"volume 306 of Lecture Notes in Computer Science","first-page":"157","volume-title":"Foundations of Logic and Functional Programming","author":"E. Giovannetti","year":"1986","unstructured":"E. Giovannetti and C. Moiso. A completeness result for E-unification algorithms based on Conditional Narrowing. In M. Boscarol, L. Carlucci, and G. Levi, editors, Foundations of Logic and Functional Programming, volume 306 of Lecture Notes in Computer Science, pages 157\u2013167. Springer-Verlag, Berlin, 1986."},{"key":"27_CR16","volume-title":"volume 353 of Lecture Notes in Artificial Intelligence","author":"S. H\u00f6lldobler","year":"1989","unstructured":"S. H\u00f6lldobler. Foundations of Equational Logic Programming, volume 353 of Lecture Notes in Artificial Intelligence. Springer-Verlag, Berlin, 1989."},{"key":"27_CR17","first-page":"318","volume-title":"volume 87 of Lecture Notes in Computer Science","author":"J.M. Hullot","year":"1980","unstructured":"J.M. Hullot. Canonical Forms and Unification. In 5th Int'l Conf. on Automated Deduction, volume 87 of Lecture Notes in Computer Science, pages 318\u2013334. Springer-Verlag, Berlin, 1980."},{"key":"27_CR18","first-page":"441","volume-title":"Logic Programming, Functions, Relations and Equations","author":"J. Jaffar","year":"1986","unstructured":"J. Jaffar, J.-L. Lassez, and M.J. Maher. A logic programming language scheme. In D. de Groot and G. Lindstrom, editors, Logic Programming, Functions, Relations and Equations, pages 441\u2013468. Prentice Hall, Englewood Cliffs, NJ, 1986."},{"key":"27_CR19","unstructured":"J.W. Klop. Term rewriting systems. In S. Abramsky, D. Gabbay, and T. Maibaum, editors, Handbook of Logic in Computer Science, volume I. Oxford University Press, 1991."},{"key":"27_CR20","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1016\/B978-0-934613-40-8.50019-1","volume-title":"Foundations of Deductive Databases and Logic Programming","author":"J.-L. Lassez","year":"1988","unstructured":"J.-L. Lassez, M. J. Maher, and K. Marriott. Unification Revisited. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, pages 587\u2013625. Morgan Kaufmann, Los Altos, Ca., 1988."},{"key":"27_CR21","first-page":"348","volume-title":"Proc. Third IEEE Symp. on Logic In Computer Science","author":"M. J. Maher","year":"1988","unstructured":"M. J. Maher. Complete Axiomatizations of the Algebras of Finite, Rational and Infinite Trees. In Proc. Third IEEE Symp. on Logic In Computer Science, pages 348\u2013357. Computer Science Press, New York, 1988."},{"key":"27_CR22","volume-title":"Technical Report RC 16042, IBM","author":"M. J. Maher","year":"1990","unstructured":"M. J. Maher. On parameterized substitutions. Technical Report RC 16042, IBM-T.J. Watson Research Center, Yorktown Heights, NY, 1990."},{"key":"27_CR23","series-title":"volume 632 of Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1007\/BFb0013830","volume-title":"Proc. Third Int'l Conf. on Algebraic and Logic Programming","author":"A. Middeldorp","year":"1992","unstructured":"A. Middeldorp and E. Hamoen. Counterexamples to completeness results for basic narrowing. In H. Kirchner and G. Levi, editors, Proc. Third Int'l Conf. on Algebraic and Logic Programming, volume 632 of Lecture Notes in Computer Science, pages 244\u2013258. Springer-Verlag, Berlin, 1992."},{"key":"27_CR24","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":"27_CR25","series-title":"volume 443 of Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"386","DOI":"10.1007\/BFb0032046","volume-title":"Proc. of the 17th International Colloquium on Automata, Languages and Programming","author":"C. Palamidessi","year":"1990","unstructured":"C. Palamidessi. Algebraic properties of idempotent substitutions. In M. S. Paterson, editor, Proc. of the 17th International Colloquium on Automata, Languages and Programming, volume 443 of Lecture Notes in Computer Science, pages 386\u2013399. Springer-Verlag, Berlin, 1990."},{"key":"27_CR26","series-title":"volume 202 of Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/3-540-15976-2_7","volume-title":"Proc. of RTA'85","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 applications to logic programming. In Proc. of RTA'85, volume 202 of Lecture Notes in Computer Science, pages 141\u2013157. Springer-Verlag, Berlin, 1985."},{"key":"27_CR27","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/S0747-7171(89)80012-4","volume":"7","author":"J.H. Siekmann","year":"1989","unstructured":"J.H. Siekmann. Unification Theory. Journal of Symbolic Computation, 7:207\u2013274, 1989.","journal-title":"Journal of Symbolic Computation"}],"container-title":["Lecture Notes in Computer Science","Progamming Language Implementation and Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57186-8_93.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:09:07Z","timestamp":1605629347000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57186-8_93"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540571865","9783540479451"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/3-540-57186-8_93","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}