{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,4]],"date-time":"2025-01-04T18:40:40Z","timestamp":1736016040838,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540638889"},{"type":"electronic","value":"9783540696612"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0000483","type":"book-chapter","created":{"date-parts":[[2005,10,5]],"date-time":"2005-10-05T10:30:36Z","timestamp":1128508236000},"page":"365-379","source":"Crossref","is-referenced-by-count":2,"title":["On partial validation of logic programs"],"prefix":"10.1007","author":[{"given":"S\u00e9bastien","family":"Limet","sequence":"first","affiliation":[]},{"given":"Fr\u00e9d\u00e9ric","family":"Saubion","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,9,7]]},"reference":[{"key":"25_CR1","unstructured":"S. Anantharaman and G. Richard. A Rewrite Mechanism for Logic Programs with Negation. In Theoretical Computer Science. Elsevier Science Publishers B.V., 1997. to appear (also Proceedings of RTA'95 LNCS 914 pp 163\u2013178)."},{"key":"25_CR2","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0743-1066(92)90050-D","volume":"14","author":"M.P. Bonacina","year":"1992","unstructured":"M.P. Bonacina and J. Hsiang. On Rewrite Programs: Semantics and Relationship with Prolog. Journal of Logic Programming, 14:155\u2013180, 1992.","journal-title":"Journal of Logic Programming"},{"key":"25_CR3","unstructured":"N. Dershowitz and N.A. Josephson. Logic Programming by Completion. In Proceedings of the 2nd ICLP, pages 313\u2013320, 1984."},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"N. Dershowitz and J.P. Jouannaud. Handbook of Theoretical Computer Science, volume B, chapter Rewrite Systems, pages 243\u2013309. J. Van Leeuwen, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"key":"25_CR5","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1016\/0743-1066(94)90030-2","volume":"19\u201320","author":"M. Ducass\u00e9","year":"1994","unstructured":"M. Ducass\u00e9 and J. Noy\u00e9. Logic Programming Environments: Dynamic Program Analysis and Debugging. Journal of Logic Programming, 19\u201320:351\u2013384, 1994.","journal-title":"Journal of Logic Programming"},{"key":"25_CR6","volume-title":"Tree Automata","author":"F. G\u00e9cseg","year":"1984","unstructured":"F. G\u00e9cseg and M. Steinby. Tree Automata. Akad\u00e9miai Kiad\u00f3-Budapest, 1984."},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"J.-M. Hullot. Canonical Forms and Unification. In W. Bibel and R. Kowalski, editors, Proceedings 5th International Conference on Automated Deduction, Les Arcs (France), volume 87 of LNCS, pages 318\u2013334. Springer-Verlag, July 1980.","DOI":"10.21236\/ADA087640"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"S. Limet and P. R\u00e9ty. E-Unification by Means of Tree Tuple Synchronized Grammars. In proc of the 6th Colloquium on Trees in Algebra and Programming, 1997.","DOI":"10.1007\/BFb0030616"},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"J.W. Lloyd. Foundations of Logic Programming. Symbolic Computation series. Springer Verlag, 1987 (revised version).","DOI":"10.1007\/978-3-642-83189-8"},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"G. Richard and F. Saubion. Answer Synthesis for CLP Programs with Negation. Journal of the Interest Group in Pure and Applied Logic, 5(3), april 1997.","DOI":"10.1093\/jigpal\/5.3.1-c"},{"key":"25_CR11","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/1192.001.0001","volume-title":"Algorithmic Program Debugging","author":"E. Shapiro","year":"1983","unstructured":"E. Shapiro. Algorithmic Program Debugging. MIT Press, Cambridge, MA, 1983."}],"container-title":["Lecture Notes in Computer Science","Algebraic Methodology and Software Technology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0000483","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,4]],"date-time":"2025-01-04T18:13:14Z","timestamp":1736014394000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0000483"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540638889","9783540696612"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/bfb0000483","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}