Sémantique logique et dénotationnelle des interpréteurs PROLOG
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 22 (1988) no. 1, pp. 3-42.
@article{ITA_1988__22_1_3_0,
     author = {Delahaye, Jean-Paul},
     title = {S\'emantique logique et d\'enotationnelle des interpr\'eteurs {PROLOG}},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {3--42},
     publisher = {EDP-Sciences},
     volume = {22},
     number = {1},
     year = {1988},
     zbl = {0652.68025},
     mrnumber = {945922},
     language = {fr},
     url = {http://www.numdam.org/item/ITA_1988__22_1_3_0/}
}
TY  - JOUR
AU  - Delahaye, Jean-Paul
TI  - Sémantique logique et dénotationnelle des interpréteurs PROLOG
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1988
DA  - 1988///
SP  - 3
EP  - 42
VL  - 22
IS  - 1
PB  - EDP-Sciences
UR  - http://www.numdam.org/item/ITA_1988__22_1_3_0/
UR  - https://zbmath.org/?q=an%3A0652.68025
UR  - https://www.ams.org/mathscinet-getitem?mr=945922
LA  - fr
ID  - ITA_1988__22_1_3_0
ER  - 
Delahaye, Jean-Paul. Sémantique logique et dénotationnelle des interpréteurs PROLOG. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 22 (1988) no. 1, pp. 3-42. http://www.numdam.org/item/ITA_1988__22_1_3_0/

[Apt 82] K. Aptet M. Van Emden, Contribution to the Theory of Logic Programming, Journal of the Association for Computing Machinery, 29. 3, 1982, p. 841-842. | MR 666781 | Zbl 0483.68004

[Bla 82 a] H. A. Blair, The Undecidability of Two Completeness Notions for the "Negation as Failure Rule" in Logic Programming, Proceeding of the first Logic programming Conference, Van Caneghem éd., Marseille, 1982, p. 163-168.

[Bla 82 b] H. A. Blair, The Recursion Theoretic Complexity of the Semantics of Predicate Logic as a Programming Language, Information and Control, vol. 54, 1982, p. 25-47). | MR 713306 | Zbl 0527.03022

[Cla 78] K. L. Clark, Negation as Failure. Logic and Data Bases, H. GALLAiRE et J. MINKER éd., Plenum Press, New York, 1978, p. 293-324. | MR 539848

[Cla 79] K. L. Clark, Predicate Logic as a Computational Formalism, Res. Rep., Dep of Computing, Imperial College, London, 1979.

[Col 82] A. Colmerauer, Prolog II, Manuel de Référence et Modèle Théorique, Groupe d'Intelligence Artificielle, Univ. d'Aix-Marseille, 1982.

[Del 86 a] J. P. Delahaye, Outils logiques pour l'intelligence artificielle, Eyrolles, Paris, 1986.

[Del 86 b] J. P. Delahayeet P. Paradinas, Définitions de stratégies équitables en programmation logique, Actes du Séminaire de Programmation en Logique de Tregastel, 1986, p. 7-24.

[Del 86 c] J. P. Delahaye, Sémantique logique et dénotationnelle des interpréteurs Prolog, Note IT 1986, Université des Sciences et Techniques de Lille.

[Del 87] J. P. Delahaye, Effet de l'utilisation du coupe choix sur la sémantique déclarative de Prolog, Note IT 1987, Université des Sciences et Techniques de Lille.

[Der 83] P. Deransart, An Operational Algebraic Semantics of Prolog Programs, Actes du Séminaire de « Programmation en Logique », Mehmet Dincbas éd., C.N.E.T., Lannion, 1983.

[Fit 85 a] M. Fitting, A Deterministic Prolog Fixpoint SemanticsJ. of Logic Programming, vol. 2, 1985, p. 111-118. | MR 798931 | Zbl 0592.68021

[Fit 85 b] M. Fitting, A Kripke-Kleene Semantics for Logic Programs, J. of Logic Programming, vol. 4, 1985, p. 295-312. | MR 818647 | Zbl 0589.68011

[Fla 86] T. Flannagam, The Consistency of Negation as Failure, J. Logic Programming, vol. 2, 1986, p. 93-114. | MR 902721 | Zbl 0598.68064

[Hil 74] R. Hill, Lush-Resolution and its Completeness, Dep. of Artificial Intelligence, Univ. of Edinburgh, 1974.

[JLL 83] J. Jaffar, J. L. Lassezet L. Lloyd, Completeness of the Negation as Failure Rule, IJCAI-83 Karlsruhe, 1983, p. 500-506.

[Jon 84] N. D. Joneset A. Mycroft, Stepwise Development of Operational Semantics for PROLOG, I.E.E.E., 1984, p. 182-288.

[Las 84] J. L. Lassezet M. J. Maher, Closures and Fairness in Semantics of Programming Logic, T. C. S., 29, 1984, p. 167-184). | MR 742407 | Zbl 0547.68034

[Llo 84] J. Lloyd, Foundation of Logic Programming, Springer-Verlag, New York, 1984. | MR 766562

[Rei 78] R. Reiter, On Closed world Data Bases. Logic and Data Bases, H. GALLAIRE et J. MINKER, éd., Plenum Press, New York, 1978, p. 55-76. | MR 539848

[Rob 65] J. A. Robinson, A Machine Oriented Logic Based on the Resolution Principle, J. of A.C.M., vol. 12, 1965. | MR 170494 | Zbl 0139.12303

[She 84] J. C. Shepherdson, Negation as Failure I and II, J. Logic Programming, vol. 1, 1984, p. 51-79, vol. 3, 1985, p. 185-202. | MR 754304 | Zbl 0603.68094

[VEK 76] M. H. Van Emdem et R. V. Kowalski, The Semantics of Predicate Logic as a Programming Language, J. A. C. M., vol. 23-4, 1976, p. 733-742. | MR 455509 | Zbl 0339.68004

[VEA 85] M. H. Van Emdem et M. A. Nait Abdallah, Top-Down Semantics of Fair Computations of Logic Programs, J. of Logic Programming, vol. 1, 1985, p. 67-75. | MR 793106 | Zbl 0592.68019