Abstract
The SLD resolution proof theory for the Prolog family of logic programming languages is well knpwn. The extended syntactic forms of these languages, however, distance them from the Horn language required by SLD resolution. We propose a direct proof theoretic account for logic programming. The derivations built by the inference engine are not refutations, but direct proofs of the query from the program formulae as premisses. Derivations correspond to a deductively complete subclass of natural deduction proofs called atomic normal form (ANF) proofs. The new proof theory suggests efficient implementations for more expressive logic programming languages. Also, ANF proofs are readily understood as formal counterparts of informal (but rigorous) arguments constructed by humans. Powerful explanation, debugging and control facilities can be based on this correspondence.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Krzysztof R. Apt and M. H. van Emden. Contributions to the Theory of Logic Programming. JACM, 29(3) 841–862 1982.
Keith L. Clark. ‘Negation as Failure', in H. Gallaire and J. Minker (eds). Logic and Databases. Plenum Press, 1978.
W. F. Clocksin and C. S. Mellish. Programming in Prolog. Springer-Verlag, 1981.
Haskell B. Curry. Foundations of Mathematical Logic. Dover Publications, 1977.
D. M. Gabbay and U. Reyle. N-Prolog: An Extension of Prolog with Hypothetical Implications. Journal of Logic Programming 1984:4:319–355
Gerhard Gentzen. Untersuchungen über das logische Schliessen. Mathematische Zeitschrift 39 176–210, 405–431, 1935. English translation in M. E. Szabo (ed). The Collected Papers of Gerhard Gentzen. North Holland, 1969.
Seif Haridi. Logic Programming Based on a Natural Deduction System. Technical Report TRITA-CS-8104, Department of Telecommunication Systems — Computer Systems, The Royal Institute of Technology, Stockholm, Sweden.
Seppo Keronen. Computational Natural Deduction. PhD Thesis, Department of Computer Science, Australian National University, Canberra, 1991.
Robert A. Kowalski and D. Kuehner. Linear Resolution with Selection Function. Artificial Intelligence 2 227–260, 1971.
J-L. Lassez, M. J. Maher and K. Marriott. “Unification Revisited”. in J. Minker (ed.) Deductive Databases and Logic Programming. Morgan Kaufmann, 1988.
John W. Lloyd. Foundations of Logic Programming. Springer-Verlag, 1984
John W. Lloyd and Rodney W. Topor. Making Prolog More Expressive. Journal of Logic Programming 3 225–240, 1984.
Nils J. Nilsson. Principles of Artificial Intelligence. Tioga, 1980.
Lawrence C. Paulson. Logic and Computation (Interactive Proof with Cambridge LCF). Cambridge University Press, 1987.
Dag Prawitz. Natural Deduction (A Proof-Theoretical Study). Almqvist & Wiksell, 1965.
J. A. Robinson. A Machine-Oriented Logic Based On the Resolution Principle. JACM, 12(1) 23–41, 1965.
D. J. Shoesmith and T. J. Smiley. Multiple-conclusion Logic. Cambridge University Press, 1978.
Neil W. Tennant. Natural Logic. Edinburgh University Press, 1978.
J. van Vaalen. An extension of unification to substitutions with an application to automatic theorem proving. in IJCAI-4.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Keronen, S. (1993). Natural deduction proof theory for logic programming. In: Lamma, E., Mello, P. (eds) Extensions of Logic Programming. ELP 1992. Lecture Notes in Computer Science, vol 660. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56454-3_14
Download citation
DOI: https://doi.org/10.1007/3-540-56454-3_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56454-6
Online ISBN: 978-3-540-47562-0
eBook Packages: Springer Book Archive