Cut formulae and logic programming
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 b...
| Autor principal: | |
|---|---|
| Formato: | conferencePaper |
| Idioma: | eng |
| Publicado em: |
1994
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/1822/3819 |
| País: | Portugal |
| Oai: | oai:repositorium.sdum.uminho.pt:1822/3819 |