Algorithmic Proof with Diminishing Resources, part 1 (1991)
by
D M Gabbay
| Venue: | In Borger, E. (Ed.), CSL'90. Fourth Workshop on Computer Science Logic, No. 533 in Lecture Notes in Computer Science |
| Citations: | 7 - 1 self |
BibTeX
@INPROCEEDINGS{Gabbay91algorithmicproof,
author = {D M Gabbay},
title = {Algorithmic Proof with Diminishing Resources, part 1},
booktitle = {In Borger, E. (Ed.), CSL'90. Fourth Workshop on Computer Science Logic, No. 533 in Lecture Notes in Computer Science},
year = {1991},
pages = {156--173},
publisher = {Springer-Verlag}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We present goal directed computation prcedures for da~ical, intuitionistic and linear implication. The procedure allows for using aasumptioM at mest once. Gompletene ~ is proved and proof theoretic results such as interpolation are indicated. 1
Citations
| 2 | Decision procedure for propositional n-prolog - Hudelmaier - 1990 |
| 1 | Theory of Algorithmic Proof, A chapter in Handbook of Logic - Gabbay |
| 1 | I~bclld Deducfi~e Systems - Gabbay - 1992 |
| 1 | U Reyle, N-Prolog I - Gabbay - 1984 |
| 1 | A family of goal directed theorem provers based on conjunction and implication, to appear in Yournal of Au~omaled Reasoning - Gabbay, Kriwaczek |
