Utilize este identificador para referenciar este registo:
https://hdl.handle.net/1822/3819
Registo completo
Campo DC | Valor | Idioma |
---|---|---|
dc.contributor.author | Pinto, Luís F. | - |
dc.date.accessioned | 2006-01-05T12:37:57Z | - |
dc.date.available | 2006-01-05T12:37:57Z | - |
dc.date.issued | 1994 | - |
dc.identifier.citation | DYCKHOFF, Roy, ed. – “Extensions of logic programming : 4th International Workshop, ELP '93, St Andrews, U.K., March 29 - April 1, 1993. Proceedings”. Berlin : Springer-Verlag, cop. 1994. ISBN: 3-540-58025-5. p. 282-300. | eng |
dc.identifier.uri | https://hdl.handle.net/1822/3819 | - |
dc.description.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. | eng |
dc.description.sponsorship | Junta Nacional de Investigação Científica e Tecnológica (JNICT). | eng |
dc.description.sponsorship | União Europeia (UE) - Programa ESPRIT - grant BRA 7232 GENTZEN. | eng |
dc.language.iso | eng | eng |
dc.publisher | Springer Verlag | eng |
dc.rights | openAccess | eng |
dc.subject | Proof search | eng |
dc.subject | Sequent calculus | eng |
dc.subject | Cut-rule | eng |
dc.subject | Logic programming | eng |
dc.title | Cut formulae and logic programming | eng |
dc.type | conferencePaper | eng |
dc.peerreviewed | yes | eng |
sdum.pagination | 282-300 | eng |
sdum.publicationstatus | published | eng |
sdum.volume | 798 | eng |
Aparece nas coleções: |
Ficheiros deste registo:
Ficheiro | Descrição | Tamanho | Formato | |
---|---|---|---|---|
cut.ps | 196,17 kB | Postscript | Ver/Abrir | |
cut.pdf | 229,21 kB | Adobe PDF | Ver/Abrir |