Luis Pinto  Home/Search
Context Related
| theory.dcs.stand.ac.uk/public...cut.ps theory.dcs.stand.ac.uk/~rd/pu...cut.ps theory.cs.stand.ac.uk/publica...cut.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: theory.dcs.stand.ac.uk/public... (more) From: theory.cs.stand.ac.uk/publica... (Enter author homepages) |
Rate this article:      (best)Comment on this article |
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... (Update)
Context of citations to this paper: More
...on which to develop a programming language that integrates logic and functional programming. This work develops the ideas outlined in [Pin94], which are intended to be a first step towards a proof theoretic characterisation of such programming. The central idea is that the...
.... to find proofs that are exponentially shorter than their variants formed by means of neither the definition mechanism nor the cut rule [134]. In the extension proposed in [135] definitions can be used as abbreviations but can also be employed in searching for shorter proofs of...
Cited by: More
Strong Normalization Proofs for Cut Elimination in Gentzen's.. - Bittar (Correct)
Proof-search in Type-theoretic Languages: An Introduction - Galmiche, al. (2000) (Correct)
Strong Normalisation Proofs for Cut Elimination in Gentzen's.. - Bittar (1996) (Correct)
Active bibliography (related documents): More All
0.6: A Constructive Type System to Integrate Logic and Functional.. - Pinto, Dyckhoff (1994) (Correct)
0.3: Proof-Terms for Classical and Intuitionistic Resolution - Ritter, Pym, Wallen (1996) (Correct)
0.2: On the Intuitionistic Force of Classical Search - Ritter, Pym (1996) (Correct)
Similar documents based on text: More All
0.2: Proof Search in Constructive Logics - Dyckhoff, Pinto (1998) (Correct)
0.2: Cut-Elimination and a Permutation-Free Sequent Calculus for.. - Dyckhoff, Pinto (1998) (Correct)
0.2: Compositional Proof Systems for Model Checking Infinite State.. - Dam (1995) (Correct)
Related documents from co-citation: More All
4: The semantics and proof theory of the logic of bunched implications (context) - Pym - 1998
4: A linear logical framework - Cervesato, Pfenning - 1996
4: The use of explicit plans to guide proofs (context) - Bundy - 1988
BibTeX entry: (Update)
Pinto, L.: Cut formulae and logic programming, in [d1], 283--301. http://citeseer.ist.psu.edu/99662.html More
@inproceedings{ pinto93cut,
author = "Luis Pinto",
title = "Cut Formulae and Logic Programming",
booktitle = "Extensions of Logic Programming",
pages = "282-300",
year = "1993",
url = "citeseer.ist.psu.edu/99662.html" }
Citations (may not include all citations):434 A framework for defining logics - Harper, Honsell et al. - 1987
340 Uniform proofs as a foundation for logic programming (context) - Miller, Nadathur et al. - 1991
268 Proofs and Types (context) - Girard, Lafont et al. - 1989
236 Intuitionistic Type Theory (context) - Martin-Lof - 1984
210 Logic programming in the LF logical framework - Pfenning - 1991
166 An overview of Prolog (context) - Nadathur, Miller - 1988
146 Investigations into logical deduction (context) - Gentzen - 1969
77 Type Theory and Functional Programming (context) - Thompson - 1991
33 Deliverables: a categorical approach to program development .. - McKinna, Burstall - 1993
27 Abstractions in logic programming (context) - Miller - 1990
24 Dependent types in logic programming (context) - Pfenning - 1992
16 Proof-search in the \Pi-calculus (context) - Pym, Wallen - 1991
10 search and computation in general logic (context) - Pym - 1990
9 Logic programming via proof-valued computations (context) - Pym, Wallen - 1992
8 Don't eliminate cut (context) - Boolos - 1984
8 Lisp and Symbolic Computation (context) - Ait-Kaci, Nasr et al. - 1989
8 A Curry-Howard isomorphism for sequent calculus (context) - Wadler - 1993
7 Some applications of Gentzen's proof theory in automated ded.. (context) - Beeson - 1989
1 Proof-theoretic semantics and integration of logic and funct.. (context) - Pinto
1 Relating logic programming and propositions-as-types: a logi.. (context) - Lipton - 1992
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www-theory.dcs.st-and.ac.uk/publications/rd/): More
A Permutation-free Calculus for Lax Logic - Howe (1998) (Correct)
Unknown - Frameworks For (Correct)
Theorem Proving and Partial Proof Search for Intuitionistic.. - Jacob Howe (1996) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC