Intuitionistic three-valued logic and logic programming
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 25 (1991) no. 6, pp. 557-587.

Voir la notice de l'article provenant de la source Numdam

@article{ITA_1991__25_6_557_0,
     author = {Vauzeilles, J. and Strauss, A.},
     title = {Intuitionistic three-valued logic and logic programming},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {557--587},
     publisher = {EDP-Sciences},
     volume = {25},
     number = {6},
     year = {1991},
     mrnumber = {1145428},
     zbl = {0771.68084},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/ITA_1991__25_6_557_0/}
}
TY  - JOUR
AU  - Vauzeilles, J.
AU  - Strauss, A.
TI  - Intuitionistic three-valued logic and logic programming
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1991
SP  - 557
EP  - 587
VL  - 25
IS  - 6
PB  - EDP-Sciences
UR  - http://geodesic.mathdoc.fr/item/ITA_1991__25_6_557_0/
LA  - en
ID  - ITA_1991__25_6_557_0
ER  - 
%0 Journal Article
%A Vauzeilles, J.
%A Strauss, A.
%T Intuitionistic three-valued logic and logic programming
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1991
%P 557-587
%V 25
%N 6
%I EDP-Sciences
%U http://geodesic.mathdoc.fr/item/ITA_1991__25_6_557_0/
%G en
%F ITA_1991__25_6_557_0
Vauzeilles, J.; Strauss, A. Intuitionistic three-valued logic and logic programming. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 25 (1991) no. 6, pp. 557-587. http://geodesic.mathdoc.fr/item/ITA_1991__25_6_557_0/

1. S. Cerrito, Negation as Failure: a Linear Axiomatization, Rapport de recherche, L.R.I., Orsay, 1988.

2. K. L. Clark, Négation as Failure, in Logic and Database, H. GALLAIRE and J. MINER Eds., Plenum Press, New York, 1978, pp.293-322.

3. J. P. Delahaye, Chaînage avant et calcul de modèles booléens et trivalués, Expert Systems and their applications, Avignon, 1987.

4. M. Fitting, A Kripke-Kleene Semantics for General Logic programs, J. Logic Programming, 1985, 2, pp. 295-321. | Zbl | MR

5. J. Gallier, Logic for Computer Science: Foundations of Automatic Theorem proving, Harper and Row, New York, 1986. | Zbl

6. G. Gentzen, Collected works, SZABO Ed., North Holland, Amsterdam, 1969. | MR

7. J. Y. Girard, Three-Valued Logic and Cut-Elimination: The Actual Meaning of Takeuti's Conjecture, Dissertationes Math., Warszawa, 1976. | Zbl

8. J. Y. Girard, Théorie de la démonstration, Cours de 3° cycle, Université Paris-VII, 1986.

9. J. Y. Girard, Proof Theory and Logical Complexity, 1987, 1, Napoli, Bibliopolis. | Zbl | MR

10. K. Kunen, Negation in logic programming, J. Logic programming, 1987, 4, pp. 289-308. | Zbl | MR

11. J. W. Lloyd, Foundations of Logic programming, Second Edition, Springer Verlag, Berlin, 1987. | Zbl | MR

12. P. H. Schmitt, Computational Aspects of Three Valued Logic, Proc. 8th Conf. Automated Déduction, Lecture Notes in Comput. Sci., 1986, 230, Springer-Verlag, pp. 190-198. | Zbl | MR

13. J. C. Shepherdson, Negation as Failure: A Comparison of Clark's Completed Data Base and Reiter's Closes World Assumption, J. Logic Programming, 1984, 1, pp. 51-81. | Zbl | MR

14. J. C. Shepherdson, Negation as Failure II, J. Logic programming, 1985, 3, pp. 185-202. | Zbl | MR

15. J. C. Shepherdson, Negation in Logic Programming, in J. MINKER Éd., Foundations of Deductive Databases and Logic Programming, Morgan Kaufman, Los Altos, 1988, pp. 19-88. | Zbl | MR

16. M. H. Van Emden and R. Kowalski, The Semantics of Predicate Logic as a Programming Language, J. Assoc. Comput. Mach., 1976, 23, pp. 733-742. | Zbl | MR