Author:Andrei Voronkov

Publications
EasyChair Preprint no. 12145
EasyChair Preprint no. 12142
EasyChair Preprint no. 10223
EasyChair Preprint no. 9606
EasyChair Preprint no. 9217
EasyChair Preprint no. 8182
EasyChair Preprint no. 6513
EasyChair Preprint no. 5531
EasyChair Preprint no. 5176
EasyChair Preprint no. 5000
EasyChair Preprint no. 2468
EasyChair Preprint no. 3169
EasyChair Preprint no. 3148
EasyChair Preprint no. 826
EasyChair Preprint no. 98
EasyChair Preprint no. 1
Andrei Voronkov (editors)

Keyphrases

automated deduction, automated induction, automated reasoning10, automated theorem prover, automated theorem proving2, Avatar3, AVATAR architecture2, bounded quantifiers, Clausal Normal Form, clause normal form, Clausification, code trees, computability, conference management, easychair, first-order logic6, first-order theorem prover, first-order theorem proving6, FOOL, fool formula, forward subsumption, gaussian variable elimination rule, hereditarily finite sets, induction5, induction with generalization, inductive benchmarks, Inductive data types, integer induction, integers, interpolation, linear arithmetic, logic programming, next state relation, program synthesis3, program verification, proof search, Quantified First-Order Logic, recursion, Reducibility constraints, redundancy, Resolution Calculus, runtime algorithm specialization, SAT solving, Satisfiability Modulo Theories2, saturation5, Saturation Algorithms3, saturation based proof search3, saturation-based theorem proving, SMT3, SMT solving, static analysis, structural induction2, Subsumption algorithm, superposition5, superposition calculus, superposition reasoning3, superposition theorem prover, term algebra2, term indexing, theorem prover2, theorem proving8, theory reasoning2, translation, Vampire7, Web Services, Z3.