Share This Author
Complexity and expressive power of logic programming
- E. Dantsin, Thomas Eiter, G. Gottlob, A. Voronkov
- Computer ScienceProceedings of Computational Complexity. Twelfth…
- 24 June 1997
The main focus is on decidable forms of logic programming, in particular propositional logic programming and datalog, but the also mention general logic programming with function symbols, and the complexity of the unification problem is addressed.
First-Order Theorem Proving and Vampire
The superposition calculus is discussed and the key concepts of saturation and redundancy elimination are explained, present saturation algorithms and preprocessing, and demonstrate how these concepts are implemented in Vampire.
The design and implementation of VAMPIRE
This article describes VAMPIRE: a high-performance theorem prover for first-order logic and focuses on the design of the system and some key implementation features.
Path Feasibility Analysis for String-Manipulating Programs
Results on the complexity of the problem of path feasibility for programs manipulating strings using a collection of standard string library functions, including its undecidability in the general case and decidability of some special cases are proved.
Sine Qua Non for Large Theory Reasoning
This paper contains the presentation of the method for axiom selection in the Sumo INference Engine system and describes experiments with it in the theorem prover Vampire.
The Inverse Method
AVATAR: The Architecture for First-Order Theorem Provers
- A. Voronkov
- Computer Science, MathematicsCAV
- 18 July 2014
AVATAR is an important step towards efficient reasoning with both quantifiers and theories, which is one of the key areas in modern applications of theorem provers in program analysis and verification.
Vampire 1.1 (System Description)
In this abstract we describe version 1.1 of the theorem prover Vampire. We give a general description and comment on Vampire's original features and differences with the previously described version…
PDFX: fully-automated PDF-to-XML conversion of scientific literature
- A. Constantin, S. Pettifer, A. Voronkov
- Computer ScienceACM Symposium on Document Engineering
- 10 September 2013
PDFX is a rule-based system designed to reconstruct the logical structure of scholarly articles in PDF form, regardless of their formatting style, that obviates the need for domain- or layout-specific tuning or prior training.