Algorithms, datastructures, and other issues in efficient automated deduction (2001)
by
Andrei Voronkov
| Venue: | Automated Reasoning. 1st. International Joint Conference, IJCAR 2001, number 2083 in LNAI |
| Citations: | 10 - 0 self |
BibTeX
@INPROCEEDINGS{Voronkov01algorithms,datastructures,,
author = {Andrei Voronkov},
title = {Algorithms, datastructures, and other issues in efficient automated deduction},
booktitle = {Automated Reasoning. 1st. International Joint Conference, IJCAR 2001, number 2083 in LNAI},
year = {2001},
pages = {13--28},
publisher = {Springer-Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. Algorithms and datastructures form the kernel of any efficient theorem prover. In this abstract we discuss research on algorithms and datastructures for efficient theorem proving based on our experience with the theorem prover Vampire. We also briefly overview other works related to algorithms and datastructures, and to efficient theorem proving in general. 1
