Vampire is a resolution-based theorem prover for rst-order classical logic. The current version implements ordered binary resolution with the set-of-support strategy and ordered hyperresolution. The competition version will have equality rules.
Vampire owes many of its design ideas to Otter . It uses a saturation-based algorithmsimilar to that described in , but implemented more efficiently. Some planned (but not yet implemented) extensions of Vampire are directed toward the ideas underlying the design of SPASS .
Unable to display preview. Download preview PDF.
- 2.P. Graf. Term Indexing, volume 1053of Lecture Notes in Computer Science. Springer Verlag, 1996.Google Scholar
- 3.E.L. Lusk. Controlling redundancy in large search spaces: Argonne-style theorem proving through the years. In A. Voronkov, editor, Logic Programming and Automated Reasoning. International Conference LPAR’92., volume 624 of Lecture Notes in Artificial Intelligence, pages 96–106, St.Petersburg, Russia, July 1992.Google Scholar
- 5.W.W. McCune. OTTER 3.0 reference manual and guide. Technical Report ANL-94/6, Argonne National Laboratory, January 1994.Google Scholar
- 6.I.V. Ramakrishnan, R. Sekar, and A. Voronkov. Term indexing. In A. Robinson and A. Voronkov, editors, Handbook of Automated Reasoning. Elsevier Science and MIT Press, 1999. To appear.Google Scholar
- 7.M. Stickel. The path indexing method for indexing terms. Technical Report 473, Artificial Intelligence Center, SRI International, Menlo Park, CA, October 1989.Google Scholar
- 9.C. Weidenbach, B. Gaede, and G. Rock. Spass & flotter. version 0.42. In M.A. McRobbie and J.K. Slaney, editors, Automated Deduction CADE-13, volume 1104 of Lecture Notes in Computer Science, pages 141–145, New Brunswick, NJ, USA, 1996.Google Scholar