Consolution as a Framework for Comparing Calculi (1994)
Cached
Download Links
- [www.uni-koblenz.de]
- [users.rsise.anu.edu.au]
- [rsise.anu.edu.au]
- DBLP
Other Repositories/Bibliography
by
Peter Baumgartner
,
Ulrich Furbach
| Venue: | JOURNAL OF SYMBOLIC COMPUTATION |
| Citations: | 14 - 10 self |
BibTeX
@ARTICLE{Baumgartner94consolutionas,
author = {Peter Baumgartner and Ulrich Furbach},
title = {Consolution as a Framework for Comparing Calculi},
journal = {JOURNAL OF SYMBOLIC COMPUTATION},
year = {1994},
volume = {16}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In this paper, stepwise and nearly stepwise simulation results for a number of first-order proof calculi are presented and an overview is given that illustrates the relations between these calculi. For this purpose, we modify the consolution calculus in such a way that it can be instantiated to resolution, tableaux model elimination, a connection method and Loveland's model elimination.
