Author:Andrei VoronkovPublications |
---|
EasyChair Preprint 12145 | EasyChair Preprint 12142 | EasyChair Preprint 10223 | EasyChair Preprint 9606 | EasyChair Preprint 9606 | EasyChair Preprint 9606 | EasyChair Preprint 9606 | EasyChair Preprint 9606 | EasyChair Preprint 9217 | EasyChair Preprint 8182 | EasyChair Preprint 6513 | EasyChair Preprint 5531 | EasyChair Preprint 5176 | EasyChair Preprint 5000 | EasyChair Preprint 2468 | EasyChair Preprint 3169 | EasyChair Preprint 3148 | EasyChair Preprint 2468 | EasyChair Preprint 826 | EasyChair Preprint 98 | EasyChair Preprint 1 | | | | | | | | | | | | | | | | | | | | | | | | |
Keyphrasesautomated 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. |
|