{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:13:24Z","timestamp":1725455604547},"publisher-location":"Berlin\/Heidelberg","reference-count":16,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540537090"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0020825","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T06:07:52Z","timestamp":1131862072000},"page":"511-522","source":"Crossref","is-referenced-by-count":4,"title":["Unfolding, procedural and fixpoint semantics of logic programs"],"prefix":"10.1007","author":[{"given":"Fran\u00e7ois","family":"Denis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Paul","family":"Delahaye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"43_CR1","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1145\/322326.322339","volume":"29.3","author":"K. Apt","year":"1982","unstructured":"K. APT and M. VAN EMDEN, Contribution to the Theory of Logic Programming, Journal of the Association for Computing Machinery, 29.3, 1982, p. 841\u2013862.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"43_CR2","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/978-1-4684-3384-5_11","volume-title":"Negation as Failure. Logic and Data Bases","author":"K. L. Clark","year":"1978","unstructured":"K. L. CLARK, Negation as Failure. Logic and Data Bases, H. GALLAIRE and J. MINKER ed., Plenum Press, New York, 1978, p. 293\u2013324."},{"issue":"1","key":"43_CR3","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1051\/ita\/1988220100031","volume":"22","author":"J.-P. Delahaye","year":"1988","unstructured":"J.-P. DELAHAYE, S\u00e9mantique Logique et D\u00e9notationnelle des Interpr\u00e8teurs Prolog, Informatique Th\u00e9orique et Applications, vol 22, no1, 1988, p. 3\u201342.","journal-title":"Informatique Th\u00e9orique et Applications"},{"unstructured":"F. DENIS, Approximations de la s\u00e9mantique op\u00e9rationnelle d'un interpr\u00e8teur Prolog Standard par des s\u00e9mantiques axiomatiques, Rapport de recherche, septembre 1989, Laboratoire d'Informatique Fondamentale de Lille, B\u00e2t. M3, Universit\u00e9 des Sciences et Techniques de Lille, 59655 Villeneuve d'Ascq, CEDEX.","key":"43_CR4"},{"unstructured":"F. DENIS, Contribution \u00e0 l'\u00e9tude des s\u00e9mantiques axiomatiques de Prolog, Nouvelle th\u00e8se, LIFL, B\u00e2t. M3, Universit\u00e9 des Sciences et Techniques de Lille, 59655 Villeneuve d'Ascq, CEDEX.","key":"43_CR5"},{"unstructured":"P. DERANSART, G. FERRAND, Programmation en Logique avec N\u00e9gation: Pr\u00e9sentation Formelle, INRIA-Universit\u00e9 d'Orl\u00e9ans, Facult\u00e9 des Sciences, BP 6759, 45067 ORLEANS C\u00e9dex 2.","key":"43_CR6"},{"key":"43_CR7","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1145\/321978.321991","volume":"23-4","author":"M. H. Emden Van","year":"1976","unstructured":"M. H. VAN EMDEN et R. A. KOWALSKI, The Semantics of Predicate Logic as a Programming Language, Journal of the Association for Computing Machinery, vol. 23-4, 1976, p 733\u2013742.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"43_CR8","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/0304-3975(89)90070-4","volume":"69","author":"M. Falaschi","year":"1989","unstructured":"M. FALASCHI, G. LEVI, C. PALAMIDESSI, Declarative Modeling of the Operational Behavior of Logic Languages, Theorical Computer Science 69 (1989) 289\u2013318, North-Holland.","journal-title":"Theorical Computer Science"},{"unstructured":"T. KANAMORI, K. HORIUCHI, Construction of Logic programs Based on Generalized Unfold\/Fold Rules, Proc. 4th Int. Conf. on Logic Programming, The MIT Press, Series in Logic Programming (1988).","key":"43_CR9"},{"unstructured":"K. KANCHANASUT, P. STUCKEY, Eliminating negation from normal logic programs, Department of Computer Science, University of Melbourne, Parkville 3052, Australia.","key":"43_CR10"},{"key":"43_CR11","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/0304-3975(84)90017-3","volume":"29","author":"J.L. Lassez","year":"1984","unstructured":"J.L. LASSEZ, M.J. MAHER, Closures and Fairness in Semantics of Programming Logic, T.C.S., 29, 1984, p. 167\u2013184.","journal-title":"T.C.S."},{"unstructured":"G.LEVI, P. MANCARELLA, The Unfolding Semantics of Logic Programs, Technical report-13\/88, Universit\u00e0 degli Studi di Pisa, Dipartimento di Informatica.","key":"43_CR12"},{"doi-asserted-by":"crossref","unstructured":"J.W. LLOYD, Foundations of Logic Programming, Springer-Verlag (1984).","key":"43_CR13","DOI":"10.1007\/978-3-642-96826-6"},{"unstructured":"J.W. LLOYD, J.C. SHEPHERDSON, Partial evaluation in Logic Programming. Technical report CS-87-09, Dept. of Computer Science, University of Bristol (1987).","key":"43_CR14"},{"unstructured":"H. SEKI, Unfold\/Fold Transformation of Stratified Programs, Extended Abstract, Institute for New Generation Computer Technology, 1-4-28, Mita, Minato-ku, Tokyo 108, JAPAN.","key":"43_CR15"},{"unstructured":"H. TAMAKI, T. SATO, Unfold\/Fold Transformation of Logic Programs, Proc. 2th Int. Conf. on Logic Programming (1984).","key":"43_CR16"}],"container-title":["Lecture Notes in Computer Science","STACS 91"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0020825.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:45:17Z","timestamp":1607550317000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0020825"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540537090"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/bfb0020825","relation":{},"subject":[]}}