This research was supported by the Science and Engineering Research Council under grant GR/D/5939.7 as part of the ALVEY project ‘Pure Logic Language IKBS/170’ and by the National Science Foundation under grant IST-8505586. I am grateful to L Terracini, John Shepherdson and to the two anonymous referees for valuable criticism. Also thanks to L Lazarte for reading earlier versions of the manuscript.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
K. R. Apt and M. H. Van Emden, Contributions to the Theory of Logic Programming in Journal of the Association for Computing Machinery 29, 1982, pp. 841–862.
P. Balbiani, Modal Considerations on Negation as Failure, Technical Report, LSI, Toulouse, (1989).
P. Balbiani, Modal Logic and Negation as Failure, to apear Journal of Logic and Computation.
G. Boolos, The Unprovability of Consistency, Cambridge University Press, 1979.
K. L. Clark, Negation as Failure, in Logic and Databases. H. Gallaire and J. Minker (eds), Plenum, 1978, pp. 293–322.
M. Fitting, A Kripke Kleene Semantics for Logic Programs in Journal of Logic Programming 2, 1985, pp. 295–312.
D. M. Gabbay, N-Prolog Part II, Journal of Logic Programming, 4, 1985, pp 251–283.
D. M. Gabbay, Modal Provability Foundations for Negation by Failure, Technical Report 86/4, Imperial College, Department of Computing, 1986.
D. M. Gabbay and U. Reyle, N-Prolog, Part 1, Journal of Logic Programming, 1, 1984, pp 319–355
D. M. Gabbay, What is Negation in a System in Logic Colloquium 86, F. Drake and J. Truss, (eds), North Holland, 1988, pp.95–112.
D. M. Gabbay and M. J. Sergot, Negation as inconsistency, in Journal of Logic Programming, 4, 1986, pp 1–35.
S. Kripke, Semantical Considerations in Modal Logic, in Reference and Modality, L. Linsky (ed.) Oxford University Press, 1971.
K. Kunen, Negation in Logic Programming in Journal of Logic Programming 4, 1987, pp. 289–308
K. Kunen, Answer Sets and Negation as Failure, in Logic Programming, (Proceedings of the Fourth International Conference), MIT Press 1987. J L Lassez (ed).
R. E. Ladner, The computational complexity of provability in systems of modal propositional logic, SIAM Journal of Computation 6, 1977, pp 467–480.
J. L. Lassez and M. J. Maher, Optimal Fixed Points of Logic Programs, in Theoretical Computer Science 39: 1985, pp. 15–25.
J. W. Lloyd, Foundations of Logic Programming (2nd edition), Springer Verlag, 1987.
D. W. Loveland, Near Horn Prolog and Beyond, Technical Report CS 1988-25, Duke University, 1988.
R. Milner, The Use of Machines to Assist in Rigorous Proof in Mathematical Logic and Programming Languages, C.A.R. Hoare and J.C. Shepherdson (eds.) Prentics-Hall 1985 pp. 77–88.
M.O Rabin, Decidability of Second Order Theories and Automata on Infinite Trees in Transactions of the American Mathematical Society 141, 1966, pp. 1–35.
J. C. Shepherdson, Negation as Failure 1 in Journal of Logic Programming 1, 1984, pp. 1–48.
J. C. Shepherdson, Negation As Failure 2 in Journal of Logic Programming 2, 1985, pp. 185–202.
J. C. Shepherdson, Negation in Logic Programming in Foundations of Deductive Databases and Logic Programming, J Minker (ed), Morgan Kaufman, Los Altos, 1988, pp 19–88
C. Smorynski, Modal Logic and Self Reference in Handbook of Philosophical Logic vol 2, D. Gabbay and F. Guenthener (eds), D. Reidel pub. 1984, pp. 441–497.
C. Smorynski, Quantified Modal Logic and Self Reference, to appear.
C. Smorynski, Self Reference and Modal Logic, Springer Verlag 1985.
R. M. Solovay, Provability Interpretation of Modal Logic in Israel Journal of Mathematics 25, 1976, pp. 287–304.
L. Terracini, Private communication (1987)
L. Terracini, Modal Interpretation for Negation by Failure, in Atti dell'Academia delle Scienze di torino, 122, 1988, pp 81–88.
L. Terracini, A complete bi-modal system for a class of models in Atti dell'Academia delle Scienze di torino, 122, 1988, pp 116–125.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gabbay, D.M. (1991). Modal provability foundations for negation by failure. In: Schroeder-Heister, P. (eds) Extensions of Logic Programming. ELP 1989. Lecture Notes in Computer Science, vol 475. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0038695
Download citation
DOI: https://doi.org/10.1007/BFb0038695
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53590-4
Online ISBN: 978-3-540-46879-0
eBook Packages: Springer Book Archive