First-Order theorem proving and vampire

Authors:
Laura Kovács;Andrei Voronkov
Affiliations:
Chalmers University of Technology, Sweden;The University of Manchester, UK
Venue:
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
Year:
2013

Citing 23
Cited 0

A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)
An Efficient Unification Algorithm

ACM Transactions on Programming Languages and Systems (TOPLAS)
DISCOUNT - A Distributed and Learning Equational Prover

Journal of Automated Reasoning
Controlling Redundancy in Large Search Spaces: Argonne-Style Theorem Proving Through the Years

LPAR '92 Proceedings of the International Conference on Logic Programming and Automated Reasoning
SPASS & FLOTTER Version 0.42

CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
Term indexing

Handbook of automated reasoning
New Directions in Instantiation-Based Theorem Proving

LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
Limited resource strategy in resolution theorem proving

Journal of Symbolic Computation - Special issue: First order theorem proving
E - a brainiac theorem prover

AI Communications - CASC
A phytography of WALDMEISTER

AI Communications - CASC
Finding Loop Invariants for Programs over Arrays Using a Theorem Prover

FASE '09 Proceedings of the 12th International Conference on Fundamental Approaches to Software Engineering: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Interpolation and Symbol Elimination

CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
The TPTP Problem Library and Associated Infrastructure

Journal of Automated Reasoning
Bruno Buchberger's PhD thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal

Journal of Symbolic Computation
Comparing unification algorithms in first-order theorem proving

KI'09 Proceedings of the 32nd annual German conference on Advances in artificial intelligence
Invariant generation in vampire

TACAS'11/ETAPS'11 Proceedings of the 17th international conference on Tools and algorithms for the construction and analysis of systems: part of the joint European conferences on theory and practice of software
Solving systems of linear inequalities by bound propagation

CADE'11 Proceedings of the 23rd international conference on Automated deduction
On transfinite Knuth-Bendix orders

CADE'11 Proceedings of the 23rd international conference on Automated deduction
Playing in the grey area of proofs

POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Case studies on invariant generation using a saturation theorem prover

MICAI'11 Proceedings of the 10th Mexican international conference on Advances in Artificial Intelligence - Volume Part I
A practical and complete approach to predicate refinement

TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
The CADE-23 Automated Theorem Proving System Competition - CASC-23

AI Communications
Integrating linear arithmetic into superposition calculus

CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we give a short introduction in first-order theorem proving and the use of the theorem prover Vampire. We discuss the superposition calculus and explain the key concepts of saturation and redundancy elimination, present saturation algorithms and preprocessing, and demonstrate how these concepts are implemented in Vampire. Further, we also cover more recent topics and features of Vampire designed for advanced applications, including satisfiability checking, theory reasoning, interpolation, consequence elimination, and program analysis.