| | Author:Martin Suda| Publications | 
|---|
 |  |  | EasyChair Preprint 13125 |  | EasyChair Preprint 7719 |  | EasyChair Preprint 362 |  | EasyChair Preprint 361 |  | EasyChair Preprint 1 |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  | 
 Keyphrasesautomated reasoning4, automated theorem proving3, Avatar4, AVATAR architecture, blocked clauses, CEGAR, Clausal Normal Form, clause elimination, clause normal form, Clause selection, Clausification, EPR, evaluation, finite model finder, first-order logic7, first-order theorem proving2, FOOL, Graph Neural Network, higher-order, inprocessing techniques, Interference, Interpolants, IRM-calc, large theory problems, local proofs, long-distance resolution, machine learning2, Parameters Learning, partial strategy, premise selection, Preprocessing, proof checking, proving strategy, QBF, QBF calculi, randomization, Resolution Calculi, SAT2, SAT solving, Satisfiability Modulo Theories2, Saturation Algorithms2, saturation-based theorem proving2, semantics2, sine, SMT, SMT solving2, strategies, strategy invention, Strategy Scheduling, superposition, superposition calculus, theorem proving8, theory reasoning, translation, Vampire8, winning strategy, Z3. | 
 |