Intuitionistic three-valued logic and logic programming

J. Vauzeilles; A. Strauss

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1991)

  • Volume: 25, Issue: 6, page 557-587
  • ISSN: 0988-3754

How to cite

top

Vauzeilles, J., and Strauss, A.. "Intuitionistic three-valued logic and logic programming." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 25.6 (1991): 557-587. <http://eudml.org/doc/92405>.

@article{Vauzeilles1991,
author = {Vauzeilles, J., Strauss, A.},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {semantics of logic programs; Trivalued sequent calculus; SLD-resolution; Clark's completion; semantics for programs with negation; SLDNF- resolution},
language = {eng},
number = {6},
pages = {557-587},
publisher = {EDP-Sciences},
title = {Intuitionistic three-valued logic and logic programming},
url = {http://eudml.org/doc/92405},
volume = {25},
year = {1991},
}

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
PB - EDP-Sciences
VL - 25
IS - 6
SP - 557
EP - 587
LA - eng
KW - semantics of logic programs; Trivalued sequent calculus; SLD-resolution; Clark's completion; semantics for programs with negation; SLDNF- resolution
UR - http://eudml.org/doc/92405
ER -

References

top
  1. 1. S. CERRITO, Negation as Failure: a Linear Axiomatization, Rapport de recherche, L.R.I., Orsay, 1988. Zbl0754.68025
  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. 
  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. 
  4. 4. M. FITTING, A Kripke-Kleene Semantics for General Logic programs, J. Logic Programming, 1985, 2, pp. 295-321. Zbl0589.68011MR818647
  5. 5. J. GALLIER, Logic for Computer Science: Foundations of Automatic Theorem proving, Harper and Row, New York, 1986. Zbl0605.03004
  6. 6. G. GENTZEN, Collected works, SZABO Ed., North Holland, Amsterdam, 1969. MR262050
  7. 7. J. Y. GIRARD, Three-Valued Logic and Cut-Elimination: The Actual Meaning of Takeuti's Conjecture, Dissertationes Math., Warszawa, 1976. Zbl0357.02027
  8. 8. J. Y. GIRARD, Théorie de la démonstration, Cours de 3° cycle, Université Paris-VII, 1986. 
  9. 9. J. Y. GIRARD, Proof Theory and Logical Complexity, 1987, 1, Napoli, Bibliopolis. Zbl0635.03052MR903244
  10. 10. K. KUNEN, Negation in logic programming, J. Logic programming, 1987, 4, pp. 289-308. Zbl0655.68018MR916936
  11. 11. J. W. LLOYD, Foundations of Logic programming, Second Edition, Springer Verlag, Berlin, 1987. Zbl0668.68004MR911272
  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. Zbl0644.03015MR876502
  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. Zbl0575.68094MR754304
  14. 14. J. C. SHEPHERDSON, Negation as Failure II, J. Logic programming, 1985, 3, pp. 185-202. Zbl0603.68094MR817854
  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. Zbl0718.68020MR938982
  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. Zbl0339.68004MR455509

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.