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...
| Main Author: | |
|---|---|
| Format: | conferencePaper |
| Language: | eng |
| Published: |
1994
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1822/3819 |
| Country: | Portugal |
| Oai: | oai:repositorium.sdum.uminho.pt:1822/3819 |