Abstract
In this paper we present a mechanism to define names for proof-witnesses of formulae and thus to use Gentzen's cut-rule in logic programming. We consider a program to be a set of logical formulae together with a list of such definitions. Occurrences of the defined names guide the proof-search by indicating when an instance of the cut-rule should be attempted. By using the cut-rule there are proofs that can be made dramatically shorter. We explain how this idea of using the cut-rule can be applied to the logic of hereditary Harrop formulae.
Supported by JNICT (Portugal) grant BD/1423/91-IA and by ESPRIT grant BRA 7232 “GENTZEN”.
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
H. Ait-Kaci and R. Nasr. Integrating logic and functional programming. Lisp and Symbolic Computation, 2:51–89, 1989.
M. Beeson. Some applications of Gentzen's proof theory in automated deduction. In P. Schroeder-Heister, editor, Extensions of Logic Programming, international workshop, Tübingen, 1989, proceedings, volume 475 of LNC'S, pages 101–156. Springer-Verlag, 1989.
G. Boolos. Don't eliminate cut. Journal of Philosophical Logic, 13:373–378, 1984.
G. Gentzen. Investigations into logical deduction. In M. Szabo, editor, The Collected Papers of Gerhard Gentzen, pages 68–131. North-Holland, 1969.
J.Y. Girard, Y. Lafont, and P. Taylor. Proofs and Types. Cambridge University Press, 1989.
R. Harper, F. Honsell, and G. Plotkin. A framework for defining logics. In Proc. Second Annual Symposium on Logic in Computer Science, pages 194–204. IEEE, 1987.
J. Lipton. Relating logic programming and propositions-as-types: a logical compilation. In Proc. of the Workshop on Types for Proofs and Programs, Båstad, Sweden, 1992.
J. McKinna and R. Burstall. Deliverables: a categorical approach to program development in type theory. In A. Borzyszkowski and S. Sokolowski, editors, Mathematical Foundations of Computer Science 1993, volume 711 of LNCS, pages 32–67. Springer-Verlag, 1993.
D. Miller. Abstractions in logic programming. In P. Odifreddi, editor, Logic and Computer Science, pages 329–359. Academic Press, 1990.
P. Martin-Löf. Intuitionistic Type Theory. Bibliopolis, Napoli, 1984.
D. Miller, G. Nadathur, F. Pfenning, and A. Scedrov. Uniform proofs as a foundation for logic programming. Annals of Pure and Applied Logic, 51:125–157, 1991.
G. Nadathur and D. Miller. An overview of λProlog. In Proc. Fifth Internat. Logic Programming Conference, Seattle, pages 810–827. MIT Press, 1988.
F. Pfenning. Logic programming in the LF logical framework. In G. Huet and G. Plotkin, editors, Logical Frameworks, pages 149–181. Cambridge University Press, 1991.
F. Pfenning. Dependent types in logic programming. In F. Pfenning, editor, Types in Logic Programming, chapter 10, pages 285–311. MIT, 1992.
L. Pinto. Proof-theoretic semantics and integration of logic and functional programming, (in preparation).
D. Pym and L. Wallen. Proof-search in the λΠ-calculus. In G. Huet and G. Plotkin, editors, Logical Frameworks, pages 309–340. Cambridge University Press, 1991.
D. Pym and L. Wallen. Logic programming via proof-valued computations. In K. Broda, editor, Proc. 4th UK Conf. on Logic Programming, London, 1992. Springer, 92.
D. Pym. Proofs, search and computation in general logic. PhD thesis, University of Edinburgh, 1990.
S.Thompson. Type Theory and Functional Programming. Addison-Wesley, 1991.
P. Wadler. A Curry-Howard isomorphism for sequent calculus. Preprint, University of Glasgow, December 1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pinto, L. (1994). Cut formulae and 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_62
Download citation
DOI: https://doi.org/10.1007/3-540-58025-5_62
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