Abstract
In this paper, we present a three-valued intuitionistic version of Clark's completion, denoted by Comp3I(P) ; we prove the soundness of SLDNF-resolution with respect to Comp3I(P), and the completeness both for success and failure, as far as allowed programs are concerned. Then we compare our results to Kunen, Cerrito and Shepherdson's works which are based on classical three-valued logic, linear logic, and on a system of rules which are valid in both intuitionistic logic and three-valued logic.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
Bibliography
Balbiani, P. (1991) Une caractérisation modale de la sémantique des programmes logiques avec négation, Thèse de Docorat, Université Paul Sabatier, Toulouse.
Cerrito, S. (1990) A Linear Semantics for Allowed Logic Programs, Proceedings of Fifth Annual IEEE Symposium on Logic in Computer Science, IEEE Computer Society Press, 1990, pp. 219–227.
Cerrito, S. (1990) Contribution de la logique linéaire au problème de la négation par l'échec, Thèse de Doctorat, Université de Paris-Sud Centre d'Orsay.
Clark, K.L. (1978) Negation as failure, in Logic and Databases (H. Gallaire and J. Minker, Eds.), Plenum Press, New York, pp. 293–322.
Fitting, M. (1985) A Kripke-Kleene Semantics for General Logic programs, Logic Programming 2, pp. 295–312.
Gabbay, D.M. (1990) Modal Provability, Foundations for Negation by Failure, Extensions of Logic Programming, (P. Schroder Heister Ed.), Lecture Notes in Artificial Intelligence, Springer.
Gentzen, G. (1969) Collected works,ed. Szabo, North Holland, Amsterdam.
Girard, J.Y. (1976) Three-valued logic and cut-elimination: The actual meaning of Takeuti's conjecture, Dissertationes Mathematicae, Warszawa.
Girard, J.Y. (1987) Proof theory and logical complexity, vol 1. Napoli: Bibliopolis.
Girard, J.Y. (1987) Linear Logic, Theoretical Computer Science, vol. 50.
Kunen, K (1987) Negation in logic programming J. Logic programming 4, pp. 289–308.
Kunen, K (1989) Signed Data Dependencies J. Logic programming 7, 3, pp.231–245.
Lloyd, J. W. (1987) Foundations of Logic programming, Second Edition, Springer Verlag, Berlin.
Shepherdson, J.C. (1985) Negation as failure II, J. Logic programming 3, pp. 185–202.
Shepherdson, J.C. (1987) Negation in Logic programming, in: J. Minker (ed.), Foundations of Deductive Databases and Logic Programming, Morgan Kauffman, Los Altos, 1988, pp. 19–88.
Shepherdson, J.C. (1989) A Sound and Complete Semantics for a version of Negation as Failure, Theoretical Computer Science, vol. 65, no 3, pp. 343–371.
Vauzeilles, J., Strauss, A.(1991) Intuitionistic Three-Valued Logic and Logic Programming, Theoretical Informatics and Applications (R.A.I.R.O), no 6 (to appear).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Vauzeilles, J. (1991). Negation as failure and intuitionistic three-valued logic. In: Jorrand, P., Kelemen, J. (eds) Fundamentals of Artificial Intelligence Research. FAIR 1991. Lecture Notes in Computer Science, vol 535. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54507-7_19
Download citation
DOI: https://doi.org/10.1007/3-540-54507-7_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54507-1
Online ISBN: 978-3-540-38420-5
eBook Packages: Springer Book Archive