Incremental closure of free variable tableaux (2001)
| Venue: | Proc. Intl. Joint Conf. on Automated Reasoning IJCAR |
| Citations: | 30 - 4 self |
BibTeX
@INPROCEEDINGS{Giese01incrementalclosure,
author = {Martin Giese},
title = {Incremental closure of free variable tableaux},
booktitle = {Proc. Intl. Joint Conf. on Automated Reasoning IJCAR},
year = {2001},
pages = {545--560},
publisher = {Springer-Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. This paper presents a technique for automated theorem proving with free variable tableaux that does not require backtracking. Most existing automated proof procedures using free variable tableaux require iterative deepening and backtracking over applied instantiations to guarantee completeness. If the correct instantiation is hard to find, this can lead to a significant amount of duplicated work. Incremental Closure is a way of organizing the search for closing instantiations that avoids this inefficiency. 1
