Author:Armin Biere

Publications
Two flavors of DRAT Adrián Rebola-Pardo and Armin Biere EasyChair Preprint 457
Certifying Incremental SAT Solving Katalin Fazekas, Florian Pollitt, Mathias Fleury and Armin Biere In:Proceedings of 25th Conference on Logic for Programming, Artificial Intelligence and Reasoning
SAT, Computer Algebra, Multipliers Daniela Kaufmann, Armin Biere and Manuel Kauers In:Vampire 2018 and Vampire 2019. The 5th and 6th Vampire Workshops
Combining Conflict-Driven Clause Learning and Chronological Backtracking for Propositional Model Counting Sibylle Möhle and Armin Biere In:GCAI 2019. Proceedings of the 5th Global Conference on Artificial Intelligence
The Effect of Scrambling CNFs Armin Biere and Marijn Heule In:Proceedings of Pragmatics of SAT 2015 and 2018
Two flavors of DRAT Adrian Rebola Pardo and Armin Biere In:Proceedings of Pragmatics of SAT 2015 and 2018
Evaluating CDCL Restart Schemes Armin Biere and Andreas Fröhlich In:Proceedings of Pragmatics of SAT 2015 and 2018
Blocked Clauses in First-Order Logic Benjamin Kiesl, Martin Suda, Martina Seidl, Hans Tompits and Armin Biere In:LPAR-21. 21st International Conference on Logic for Programming, Artificial Intelligence and Reasoning
Clausal Proof Compression Marijn Heule and Armin Biere In:IWIL-2015. 11th International Workshop on the Implementation of Logics
SAT solving experiments in Vampire Armin Biere, Ioan Dragan, Laura Kovács and Andrei Voronkov In:Proceedings of the 1st and 2nd Vampire Workshops
iDQ: Instantiation-Based DQBF Solving Andreas Fröhlich, Gergely Kovásznai, Armin Biere and Helmut Veith In:POS-14. Fifth Pragmatics of SAT workshop
Lingeling Essentials, A Tutorial on Design and Implementation Aspects of the the SAT Solver Lingeling Armin Biere In:POS-14. Fifth Pragmatics of SAT workshop
Analysis of Portfolio-Style Parallel SAT Solving on Current Multi-Core Architectures Martin Aigner, Armin Biere, Christoph Kirsch, Aina Niemetz and Mathias Preiner In:POS-13. Pragmatics of SAT 2013
Practical Aspects of SAT Solving Armin Biere In:SMT 2012. 10th International Workshop on Satisfiability Modulo Theories
On the Complexity of Fixed-Size Bit-Vector Logics with Binary Encoded Bit-Width Gergely Kovásznai, Andreas Fröhlich and Armin Biere In:SMT 2012. 10th International Workshop on Satisfiability Modulo Theories
Practical Aspects of SAT Solving Armin Biere In:PAAR-2012. Third Workshop on Practical Aspects of Automated Reasoning
qbf2epr: A Tool for Generating EPR Formulas from QBF Martina Seidl, Florian Lonsing and Armin Biere In:PAAR-2012. Third Workshop on Practical Aspects of Automated Reasoning
Covered Clause Elimination Marijn Heule, Matti Järvisalo and Armin Biere In:LPAR-17-short. short papers for 17th International Conference on Logic for Programming, Artificial intelligence, and Reasoning.

Keyphrases

#SAT, automated reasoning², automated theorem proving², Avatar, backwards checking, bit-precise reasoning, bit-vector logics, blocked clauses, CDCL, certification, chronological backtracking, clause elimination², CNF, competition, complexity, Compression, computer algebra, conflict-driven clause learning, decision procedure, DQBF, DQDIMACS, DRAT proofs², Effectively Propositional Logic, encoding, EPR², evaluation, first-order logic, Incremental SAT, Instantiation, model counting, Multi-Core SAT solving, Multiplier circuits, NEXPTIME, parallel SAT solving, polynomial reasoning, Preprocessing, proof, proof certificates, proof checking³, proofs, propositional calculus, propositional reasoning, QBF², Quantified Boolean Formulas, rules, SAT⁶, SAT preprocessing, SAT solving², satisfiability², satisfiability checking, scrambling, simplification, SMT, Unsatisfiability proof generation², Vampire, watched literal schema.