EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 25 / No 6 (1991) RAIRO-Theor. Inf. Appl., 25 6 (1991) 557-587 References
Free Access
Issue
RAIRO-Theor. Inf. Appl.
Volume 25, Number 6, 1991
Page(s) 557 - 587
DOI https://doi.org/10.1051/ita/1991250605571
Published online 01 February 2017
  1. 1. S. CERRITO, Negation as Failure: a Linear Axiomatization, Rapport de recherche, L.R.I., Orsay, 1988. [Zbl: 0754.68025] [Google Scholar]
  2. 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. [Google Scholar]
  3. 3. J. P. DELAHAYE, Chaînage avant et calcul de modèles booléens et trivalués, Expert Systems and their applications, Avignon, 1987. [Google Scholar]
  4. 4. M. FITTING, A Kripke-Kleene Semantics for General Logic programs, J. Logic Programming, 1985, 2, pp. 295-321. [MR: 818647] [Zbl: 0589.68011] [Google Scholar]
  5. 5. J. GALLIER, Logic for Computer Science: Foundations of Automatic Theorem proving, Harper and Row, New York, 1986. [Zbl: 0605.03004] [Google Scholar]
  6. 6. G. GENTZEN, Collected works, SZABO Ed., North Holland, Amsterdam, 1969. [MR: 262050] [Google Scholar]
  7. 7. J. Y. GIRARD, Three-Valued Logic and Cut-Elimination: The Actual Meaning of Takeuti's Conjecture, Dissertationes Math., Warszawa, 1976. [EuDML: 268582] [Zbl: 0357.02027] [Google Scholar]
  8. 8. J. Y. GIRARD, Théorie de la démonstration, Cours de 3° cycle, Université Paris-VII, 1986. [Google Scholar]
  9. 9. J. Y. GIRARD, Proof Theory and Logical Complexity, 1987, 1, Napoli, Bibliopolis. [MR: 903244] [Zbl: 0635.03052] [Google Scholar]
  10. 10. K. KUNEN, Negation in logic programming, J. Logic programming, 1987, 4, pp. 289-308. [MR: 916936] [Zbl: 0655.68018] [Google Scholar]
  11. 11. J. W. LLOYD, Foundations of Logic programming, Second Edition, Springer Verlag, Berlin, 1987. [MR: 911272] [Zbl: 0668.68004] [Google Scholar]
  12. 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. [MR: 876502] [Zbl: 0644.03015] [Google Scholar]
  13. 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. [MR: 754304] [Zbl: 0575.68094] [Google Scholar]
  14. 14. J. C. SHEPHERDSON, Negation as Failure II, J. Logic programming, 1985, 3, pp. 185-202. [MR: 817854] [Zbl: 0603.68094] [Google Scholar]
  15. 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. [MR: 938982] [Zbl: 0718.68020] [Google Scholar]
  16. 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. [MR: 455509] [Zbl: 0339.68004] [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.