{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,7,23]],"date-time":"2022-07-23T09:12:22Z","timestamp":1658567542237},"reference-count":24,"publisher":"EDP Sciences","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[1988]]},"DOI":"10.1051\/ita\/1988220100031","type":"journal-article","created":{"date-parts":[[2017,2,2]],"date-time":"2017-02-02T15:12:20Z","timestamp":1486048340000},"page":"3-42","source":"Crossref","is-referenced-by-count":6,"title":["S\u00e9mantique logique et d\u00e9notationnelle des interpr\u00e9teurs PROLOG"],"prefix":"10.1051","volume":"22","author":[{"given":"Jean-Paul","family":"Delahaye","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2011,1,8]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","unstructured":"[Apt 82] APT K.et VAN EMDEN M., Contribution to the Theory of Logic Programming, Journal of the Association for Computing Machinery, 29. 3, 1982, p. 841-842.6667810483.68004","DOI":"10.1145\/322326.322339"},{"key":"R2","unstructured":"[Bla 82 a] BLAIR H. A., The Undecidability of Two Completeness Notions for the \"Negation as Failure Rule\" in Logic Programming, Proceeding of the first Logic programming Conference, Van Caneghem \u00e9d., Marseille, 1982, p. 163-168."},{"key":"R3","doi-asserted-by":"crossref","unstructured":"[Bla 82 b] BLAIR H. A., The Recursion Theoretic Complexity of the Semantics of Predicate Logic as a Programming Language, Information and Control, vol. 54, 1982, p. 25-47).7133060527.03022","DOI":"10.1016\/S0019-9958(82)91234-7"},{"key":"R4","doi-asserted-by":"crossref","unstructured":"[Cla 78] CLARK K. L., Negation as Failure. Logic and Data Bases, H. GALLAiRE et J. MINKER \u00e9d., Plenum Press, New York, 1978, p. 293-324.539848","DOI":"10.1007\/978-1-4684-3384-5_11"},{"key":"R5","unstructured":"[Cla 79] CLARK K. L., Predicate Logic as a Computational Formalism, Res. Rep., Dep of Computing, Imperial College, London, 1979."},{"key":"R6","unstructured":"[Col 82] COLMERAUER A., Prolog II, Manuel de R\u00e9f\u00e9rence et Mod\u00e8le Th\u00e9orique, Groupe d'Intelligence Artificielle, Univ. d'Aix-Marseille, 1982."},{"key":"R7","unstructured":"[Del 86 a] DELAHAYE J. P., Outils logiques pour l'intelligence artificielle, Eyrolles, Paris, 1986."},{"key":"R8","unstructured":"[Del 86 b] DELAHAYE J. P.et PARADINAS P., D\u00e9finitions de strat\u00e9gies \u00e9quitables en programmation logique, Actes du S\u00e9minaire de Programmation en Logique de Tregastel, 1986, p. 7-24."},{"key":"R9","unstructured":"[Del 86 c] DELAHAYE J. P., S\u00e9mantique logique et d\u00e9notationnelle des interpr\u00e9teurs Prolog, Note IT 1986, Universit\u00e9 des Sciences et Techniques de Lille."},{"key":"R10","unstructured":"[Del 87] DELAHAYE J. P., Effet de l'utilisation du coupe choix sur la s\u00e9mantique d\u00e9clarative de Prolog, Note IT 1987, Universit\u00e9 des Sciences et Techniques de Lille."},{"key":"R11","unstructured":"[Der 83] DERANSART P., An Operational Algebraic Semantics of Prolog Programs, Actes du S\u00e9minaire de \u00ab Programmation en Logique \u00bb, Mehmet Dincbas \u00e9d., C.N.E.T., Lannion, 1983."},{"key":"R12","doi-asserted-by":"crossref","unstructured":"[Fit 85 a] FITTING M., A Deterministic Prolog Fixpoint SemanticsJ. of Logic Programming, vol. 2, 1985, p. 111-118.7989310592.68021","DOI":"10.1016\/0743-1066(85)90014-7"},{"key":"R13","doi-asserted-by":"crossref","unstructured":"[Fit 85 b] FITTING M., A Kripke-Kleene Semantics for Logic Programs, J. of Logic Programming, vol. 4, 1985, p. 295-312.8186470589.68011","DOI":"10.1016\/S0743-1066(85)80005-4"},{"key":"R14","doi-asserted-by":"crossref","unstructured":"[Fla 86] FLANNAGAM T., The Consistency of Negation as Failure, J. Logic Programming, vol. 2, 1986, p. 93-114.9027210598.68064","DOI":"10.1016\/0743-1066(86)90017-8"},{"key":"R15","unstructured":"[Hil 74] HILL R., Lush-Resolution and its Completeness, Dep. of Artificial Intelligence, Univ. of Edinburgh, 1974."},{"key":"R16","unstructured":"[JLL 83] JAFFAR J., LASSEZ J. L.et LLOYD L., Completeness of the Negation as Failure Rule, IJCAI-83 Karlsruhe, 1983, p. 500-506."},{"key":"R17","unstructured":"[Jon 84] JONES N. D.et MYCROFT A., Stepwise Development of Operational Semantics for PROLOG, I.E.E.E., 1984, p. 182-288."},{"key":"R18","doi-asserted-by":"crossref","unstructured":"[Las 84] LASSEZ J. L.et MAHER M. J., Closures and Fairness in Semantics of Programming Logic, T. C. S., 29, 1984, p. 167-184).7424070547.68034","DOI":"10.1016\/0304-3975(84)90017-3"},{"key":"R19","doi-asserted-by":"crossref","unstructured":"[Llo 84] LLOYD J., Foundation of Logic Programming, Springer-Verlag, New York, 1984.766562","DOI":"10.1007\/978-3-642-96826-6"},{"key":"R20","doi-asserted-by":"crossref","unstructured":"[Rei 78] REITER R., On Closed world Data Bases. Logic and Data Bases, H. GALLAIRE et J. MINKER, \u00e9d., Plenum Press, New York, 1978, p. 55-76.539848","DOI":"10.1007\/978-1-4684-3384-5_3"},{"key":"R21","doi-asserted-by":"crossref","unstructured":"[Rob 65] ROBINSON J. A., A Machine Oriented Logic Based on the Resolution Principle, J. of A.C.M., vol. 12, 1965.1704940139.12303","DOI":"10.1145\/321250.321253"},{"key":"R22","doi-asserted-by":"crossref","unstructured":"[She 84] SHEPHERDSON J. C., Negation as Failure I and II, J. Logic Programming, vol. 1, 1984, p. 51-79, vol. 3, 1985, p. 185-202.7543040603.68094","DOI":"10.1016\/0743-1066(85)90018-4"},{"key":"R23","doi-asserted-by":"crossref","unstructured":"[VEK 76] VAN EMDEM M. H. et KOWALSKI R. V., The Semantics of Predicate Logic as a Programming Language, J. A. C. M., vol. 23-4, 1976, p. 733-742.4555090339.68004","DOI":"10.1145\/321978.321991"},{"key":"R24","doi-asserted-by":"crossref","unstructured":"[VEA 85] VAN EMDEM M. H. et NAIT ABDALLAH M. A., Top-Down Semantics of Fair Computations of Logic Programs, J. of Logic Programming, vol. 1, 1985, p. 67-75.7931060592.68019","DOI":"10.1016\/0743-1066(85)90005-6"}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1988220100031\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,23]],"date-time":"2022-07-23T08:32:24Z","timestamp":1658565144000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1988220100031"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988]]},"references-count":24,"journal-issue":{"issue":"1"},"alternative-id":["ita1988220100031"],"URL":"https:\/\/doi.org\/10.1051\/ita\/1988220100031","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"1290-385X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1988]]}}}