Talks and Poster Presentations (without Proceedings-Entry):
G. Reger, M. Suda, A. Voronkov:
"Instantiation and Pretending to be an SMT Solver with Vampire";
Talk: SMT 2017 - 15th International Workshop on Satisfiability Modulo Theories,
This paper aims to do two things. Firstly, it discusses how the VAMPIRE automatic theorem prover
both succeeds and fails at pretending to be an SMT solver. We discuss how Vampire reasons with
problems containing both quantification and theories, the limitations this places on what it can do, and
the advantages this provides over the standard SMT approach. Secondly, it focuses on the problem of
instantiation of quantified formulas and asks whether VAMPIRE needs it (it does) and whether it can
directly borrow techniques from SMT solving (maybe).
automated theorem proving, theory reasoning, SMT
Electronic version of the publication:
Created from the Publication Database of the Vienna University of Technology.