Abstract
First, we aim to provide a proof-theoretic reconstruction of logic programming, both for definite and for normal programs. This leads us to a better understanding of negation-as-failure (NF) [5] and of other proof-theoretically well-founded extensions of Prolog. Our ambition is to show that almost everything in the vulgate of logic programming can be carried out in a style close to natural deduction, and in particular in a restricted fragment of minimal logic. Secondly, we embark on a generalization and abstraction of the nice properties of SLD-resolution. The outcome is our formulation of the concept of regular search space. Here many logics can be expressed and provided they can be shown to be regular, they are then guaranteed to enjoy an analogue of the very features that make Prolog a feasible and successful implementation of logic. This can also serve as a basis of a fairly general new logic programming language, similarly to what is done in [11].
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Apt K.A., Blair H. A. & Walker A.: Towards a Theory of Declarative Knowledge. In: Foundations of Deductive Databases and Logic Programming, Minker J. (ed.), pp. 89–148, Morgan Kaufmann, 1988.
Apt K.A.: An Introduction to Logic Programming. In: Handbook of Theoretical Computer Science, Leuween J. (ed.), Elsevier 1990.
Aronsson M., Eriksson L-H., Gäredal A. & Olin P.: The Programming Language GCLA: a Definitional Approach to Logic Programming. New Generating Computing 7, pp. 381–404, 1990.
Barbuti R., Mancarella P., Pedreschi D. & Turini F.: A Transformational Approach to Negation in Logic Programming. Journal of Logic Programming 8, pp. 201–228, 1990.
Clark K.L.: Negation as Failure. In: Logic and Data Bases, Gallaire H. & Minker J. (eds.), Plenum Press, New York, pp. 293–322, 1978.
Dyckhoff R.: Contraction-Free Sequent Calculi for Intuitionistic Logic. Journal of Symbolic Logic 57, pp. 795–807, 1992.
Fitting M.: First-Order Logic and Automated Theorem Proving. Springer-Verlag, 1990.
Gabbay D. M. & Reyle U.: N-Prolog: an Extension of Prolog with Hypothetical Implications 1. Journal of Logic Programming 1, pp. 319–355, 1984.
Gallier J.: Logic for Computer Science, Foundations of Automatic Theorem Proving. Harper & Row, New York, 1986.
Hallnäs L. & Schroeder-Heister P.: A Proof-Theoretic Approach to Logic Programming: Clauses as Rules. Journal of Logic and Computation 1, pp. 261–283, 1990.
Hallnäs L. & Schroeder-Heister P.: A Proof-Theoretic Approach to Logic Programming: Programs as Definitions. Journal of Logic and Computation 1, pp. 635–660, 1991.
Hallnäs L.: Partial Inductive Definitions. Theoretical Computer Science 87, pp. 115–147, 1991.
Harland J.: On Hereditary Harrop Formulae as a Basis for Logic Programming. PhD Thesis, Edinburgh 1991.
Harland J.: Towards a Static Proof System for Negation as Failure. Citri/TR-92-49, University of Melbourne, 1992.
Kunen K.: Negation in Logic Programming. Journal of Logic Programming 4, pp. 289–308, 1987.
Lassez J-L., Maher M.J. & Marriot K.: Unification Revisited.: In: Foundations of Deductive Databases and Logic Programming. Minker J. (ed.), Morgan Kaufmann, pp. 587–626, 1988.
Lloyd J.W.: Foundations of Logic Programming. Second Extended Edition, Springer-Verlag, Berlin, 1987.
Lloyd J.W. & Shepherdson J.: Partial Evaluation in Logic Programming. Journal of Logic Programming 11, pp. 217–242, 1991.
Miller D.: A Logical Analysis of Modules in Logic Programming. Journal of Logic Programming 6, pp. 79–108, 1989.
Miller D., Nadathur G., Pfenning F., Scedrov A.: Uniform Proofs as a Foundation for Logic Programming. Annals of Pure and Applied Logic 51, pp. 125–157, 1991.
Ornaghi M. & Momigliano A.: A Proof-Theoretic Reconstruction of Logic Programming. Abstract. In: Workshop on Proof and Types, Pfenning F. (ed.) JICSLP92, Washington, pp 22–23, 1992.
Plaisted D.A.: Non-Horn Logic Programming without Contrapositives. JJournal of Automated Reasoning 4, pp. 287–325, 1988.
Pfenning F.: Unification and Anti-Unification in the Calculus of Constructions. Proc. of LICS91, pp. 74–85, 1991.
Pfenning F.: Dependent Types in Logic Programming. Types in Logic Programming, Pfenning F. (ed.), MIT Press, Cambridge, pp. 285–312, 1992.
Shepherdson J.C.: Negation in Logic Programming. In: Foundations of Deductive Databases and Logic Programming, Minker J. (ed.), Morgan Kaufmann, pp. 19–88, 1988.
Snyder W. & Lynch C.: Goal-Oriented Strategies for Paramodulation, RTA-91, Book R.V. (ed.), Lecture Notes in Computer Science 488, Springer-Verlag, pp. 150–161, 1991.
Stärk R.: The Proof-Theory of Logic Programs with Negation. PhD Thesis, University of Bern, 1992.
Stärk R.: Cut-Property and Negation as Failure. Technical Report, University of Bern, 1992.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Momigliano, A., Ornaghi, M. (1994). Regular search spaces as a foundation of logic programming. In: Dyckhoff, R. (eds) Extensions of Logic Programming. ELP 1993. Lecture Notes in Computer Science, vol 798. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58025-5_59
Download citation
DOI: https://doi.org/10.1007/3-540-58025-5_59
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58025-6
Online ISBN: 978-3-540-48417-2
eBook Packages: Springer Book Archive