{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:01:15Z","timestamp":1725663675152},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540544449"},{"type":"electronic","value":"9783540383628"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54444-5_92","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:49:04Z","timestamp":1330210144000},"page":"111-122","source":"Crossref","is-referenced-by-count":0,"title":["Narrowing as an incremental constraint satisfaction algorithm"],"prefix":"10.1007","author":[{"given":"Mar\u00eda","family":"Alpuente","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moreno","family":"Falaschi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,4]]},"reference":[{"key":"10_CR1","unstructured":"M. Alpuente, M. Falaschi, and G. Levi. Incremental Constraint Satisfaction for Equational Logic Programming. Technical report, Dipartimento di Informatica, Universit\u00e0 di Pisa, 1991. in preparation."},{"key":"10_CR2","doi-asserted-by":"crossref","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":"10_CR3","unstructured":"N. Dershowitz and A. Plaisted. Logic Programming cum Applicative Programming. In Proc. First IEEE Int'l Symp. on Logic Programming, pages 54\u201366. IEEE, 1984."},{"key":"10_CR4","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":"10_CR5","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/BF00248322","volume":"5","author":"U. Furbach","year":"1989","unstructured":"U. Furbach, S. H\u00f6lldobler, and J. Schreiber. Horn equality theories and paramodulation. Journal of Automated Reasoning, 5:309\u2013337, 1989.","journal-title":"Journal of Automated Reasoning"},{"key":"10_CR6","unstructured":"M. Gabbrielli and G. Levi. Modeling answer constraints in Constraint Logic Programs. In K. Furukawa, editor, Proc. eighth Int'l Conf. on Logic Programming. The MIT Press, 1991. to appear."},{"key":"10_CR7","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":"10_CR8","doi-asserted-by":"crossref","unstructured":"E. Giovannetti, G. Levi, C. Moiso, and C. Palamidessi. Kernel Leaf: A Logic plus Functional Language. Journal of Computer and System Sciences, 42, 1991.","DOI":"10.1016\/0022-0000(91)90009-T"},{"key":"10_CR9","first-page":"295","volume-title":"Logic Programming, Functions, Relations and Equations","author":"J. A. Goguen","year":"1986","unstructured":"J. A. Goguen and J. Meseguer. Eqlog: equality, types and generic modules for logic programming. In D. de Groot and G. Lindstrom, editors, Logic Programming, Functions, Relations and Equations, pages 295\u2013262. Prentice Hall, Englewood Cliffs, NJ, 1986."},{"key":"10_CR10","first-page":"189","volume-title":"Proc. Seventh Int'l Conf. on Logic Programming","author":"P. Hentenryck Van","year":"1990","unstructured":"P. Van Hentenryck. Incremental Constraint Satisfaction in logic programming. In D.H.D. Warren and P. Szeredi, editors, Proc. Seventh Int'l Conf. on Logic Programming, pages 189\u2013202. The MIT Press, Cambridge, Mass., 1990."},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"S. H\u00f6lldobler. Foundations of Equational Logic Programming, volume 353 of Lecture Notes in Artificial Intelligence. Springer-Verlag, Berlin, 1989. subseries of Lecture Notes in Computer Science.","DOI":"10.1007\/BFb0015791"},{"key":"10_CR12","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0304-3975(90)90063-N","volume":"75","author":"S. H\u00f6lldobler","year":"1990","unstructured":"S. H\u00f6lldobler. Conditional equational theories and complete sets of transformations. Theoretical Computer Science, 75:85\u2013110, 1990.","journal-title":"Theoretical Computer Science"},{"key":"10_CR13","first-page":"318","volume-title":"5th Int'l Conf. on Automated Deduction, 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":"10_CR14","unstructured":"H. Hussman. Unification in conditional-equational theories. Technical report, fakult\u00e4t f\u00fcr mathematik und informatik, Universit\u00e4t Passau, 1986."},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"J. Jaffar and J.-L. Lassez. Constraint Logic Programming. Technical report, Department of Computer Science, Monash University, 1986.","DOI":"10.1145\/41625.41635"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"J. Jaffar and J.-L. Lassez. Constraint Logic Programming. In Proc. Fourteenth Annual ACM Symp. on Principles of Programming Languages, pages 111\u2013119. ACM, 1987.","DOI":"10.1145\/41625.41635"},{"key":"10_CR17","unstructured":"J. Jaffar and S. Michaylov. Methodology and Implementation of a CLP System. In J.-L. Lassez, editor, Proc. Fourth Int'l Conf. on Logic Programming, pages 196\u2013218. The MIT Press, 1987."},{"key":"10_CR18","doi-asserted-by":"crossref","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":"10_CR19","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-83189-8","volume-title":"Foundations of logic programming","author":"J.W. Lloyd","year":"1987","unstructured":"J.W. Lloyd. Foundations of logic programming. Springer-Verlag, Berlin, 1987. second edition.","edition":"second edition"},{"key":"10_CR20","first-page":"223","volume-title":"Algebraic and Logic Programming, volume 343 of Lecture Notes in Computer Science","author":"J.J. Moreno","year":"1988","unstructured":"J.J. Moreno and M. Rodriguez-Artalejo. BABEL: A Functional and Logic Programming Language based on a constructor discipline and narrowing. In I. Grabowski, P. Lescanne, and W. Wechler, editors, Algebraic and Logic Programming, volume 343 of Lecture Notes in Computer Science, pages 223\u2013232. Springer-Verlag, Berlin, 1988."},{"key":"10_CR21","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":"10_CR22","unstructured":"G. Plotkin. A structured approach to operational semantics. Technical Report DAIMI FN-19, Computer Science Department, Aarhus University, 1981."},{"key":"10_CR23","first-page":"1","volume-title":"7th Int'l Conf. on Automated Deduction, volume 170 of Lecture Notes in Computer Science","author":"J.H. Siekmann","year":"1984","unstructured":"J.H. Siekmann. Universal unification. In 7th Int'l Conf. on Automated Deduction, volume 170 of Lecture Notes in Computer Science, pages 1\u201342. Springer-Verlag, Berlin, 1984."}],"container-title":["Lecture Notes in Computer Science","Programming Language Implementation and Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54444-5_92.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T03:48:07Z","timestamp":1640922487000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54444-5_92"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540544449","9783540383628"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-54444-5_92","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}