Preview
Unable to display preview. Download preview PDF.
References
L. Cavedon and J. W. Lloyd. A Completeness Theorem for SLDNF Resolution. J. Logic Programming, 7(4):177–193 (1989).
M. Fitting. A Kripke-Kleene Semantics for Logic Programs. J. Logic Programming, 2(4):295–312 (1985).
D. M. Gabbay and M. J. Sergot. Negation as Inconsistency. I J. Logic Programming, 3(1):1–36 (1986).
S. C. Kleene. Introduction to Metamathematics. Van Nostrand, Princeton, 1952.
R. A. Kowalski. Logic for Problem Solving. North-Holland, 1979.
K. Kunen. Negation in Logic Programming. J. Logic Programming, 4(4):289–308 (1987).
K. Kunen. Signed Data Dependencies in Logic Programs. J. Logic Programming, 7(4):231–245 (1989).
J. W. Lloyd. Foundations of Logic Programming. Berlin, Springer, 1984.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gomolko, A. (1994). Negation as inconsistency in PROLOG via intuitionistic logic. In: Börger, E., Gurevich, Y., Meinke, K. (eds) Computer Science Logic. CSL 1993. Lecture Notes in Computer Science, vol 832. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0049328
Download citation
DOI: https://doi.org/10.1007/BFb0049328
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58277-9
Online ISBN: 978-3-540-48599-5
eBook Packages: Springer Book Archive