A
Andrei Voronkov
Researcher at University of Manchester
Publications - 246
Citations - 7619
Andrei Voronkov is an academic researcher from University of Manchester. The author has contributed to research in topics: Automated theorem proving & Decidability. The author has an hindex of 40, co-authored 243 publications receiving 7231 citations. Previous affiliations of Andrei Voronkov include Vienna University of Technology & Uppsala University.
Papers
More filters
Journal ArticleDOI
Complexity and expressive power of logic programming
TL;DR: This article surveys various complexity and expressiveness results on different forms of logic programming, in particular, propositional logic programming and datalog, but it also mentions general logic programming with function symbols.
Book ChapterDOI
Handbook of automated reasoning
Alan Robinson,Andrei Voronkov +1 more
TL;DR: In this paper, the authors present a framework for Saturation-Based Theorem Proving (SBER) and a set of methods for E-unification of linear logic models, based on the concept of normal forms.
Journal Article
The design and implementation of VAMPIRE
TL;DR: 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.
Book ChapterDOI
First-Order Theorem Proving and Vampire
Laura Kovács,Andrei Voronkov +1 more
TL;DR: 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.
Proceedings ArticleDOI
Complexity and expressive power of logic programming
TL;DR: 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.