Abstract
Following an underrated paper by Miller [7], minimal negation is added to first-order Hereditary Harrop-formulae (fohh) at no computational cost, preserving their nature of abstract logic programming language [8]. The soundness and completeness theorem is proved with respect to natural deduction. The following relation with negation-as-failure holds: G has a SLDNF derivation from P iff G has a uniform proof from the completion of P. Moreover we show how to embed minimal, intuitionistic and classical logic into fohh: as a consequence and application of the two last results, the logic is shown to represent every partial recursive functions.
Preview
Unable to display preview. Download preview PDF.
References
Chan D. Constructive Negation Based on the Completed Database, Proc. 5th Conf. Logic Programming, Kowalski&Bowen (eds.), 1988.
Clark K.L. Negation as Failure in: Gallaire & Minker (eds.), Logic and Data Bases, Plenum Press, New York, 1978.
Gabbay D. & Sergot M. Negations as Inconsistency: I, JLP, pp. 1–36, 1986.
Johansonn I. Der MinimalKalkül, ein reduzierter intuitioniticher Formalismus, Compositio Mathmatica, vol. 4, pp. 119–136, 1936.
Harland J. On Hereditary Harrop Formulae as a Basis for Logic Programming, PhD Thesis, Edinburgh 1991.
Lloyd J.W. Foundations of Logic Programming, Second Extended Edition, Springer-Verlag, Berlin, 1987.
Miller D. A Logical Analysis of Modules in Logic Programming, JLP, pp. 79–108, 1989.
Miller D. & Nadathur G. & Pfenning F. & Scedrov A. Uniform Proofs as a Foundation for Logic Programming, to appear in The Annals of Pure and Applied Logic
Pfenning F. Notes on Logic Programming, unpublished, 1991.
Prawitz D. Natural Deduction, Almqvist&Wiksell, Stockholm 1965.
Shepherdson J.C. Negation in Logic Programming in: Foundations of Deductive Databases and Logic Programming Minker J. (ed.) Morgan Kaufmann, 1988.
Sterling L. & Shapiro E. The Art of Prolog, MIT Press, 1986.
Troesltra A.S. & van Dalen D. Constructivism in Mathematics, vol 1. North-Holland, Amsterdam 1988.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Momigliano, A. (1992). Minimal negation and Hereditary Harrop formulae. In: Nerode, A., Taitslin, M. (eds) Logical Foundations of Computer Science — Tver '92. LFCS 1992. Lecture Notes in Computer Science, vol 620. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0023886
Download citation
DOI: https://doi.org/10.1007/BFb0023886
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55707-4
Online ISBN: 978-3-540-47276-6
eBook Packages: Springer Book Archive