| Short proofs without new variables MJH Heule, B Kiesl, A Biere Automated Deduction–CADE 26: 26th International Conference on Automated …, 2017 | 53 | 2017 |
| Preprocessing in SAT Solving A Biere, M Järvisalo, B Kiesl Handbook of Satisfiability, 391-435, 2021 | 49 | 2021 |
| A Formal Analysis of IEEE 802.11's WPA2: Countering the Kracks Caused by Cracking the Counters C Cremers, B Kiesl, N Medinger 29th USENIX Security Symposium (USENIX Security 20), 1-17, 2020 | 45 | 2020 |
| PRuning through satisfaction MJH Heule, B Kiesl, M Seidl, A Biere Haifa Verification Conference, 179-194, 2017 | 43 | 2017 |
| Strong extension-free proof systems MJH Heule, B Kiesl, A Biere Journal of Automated Reasoning 64 (3), 533-554, 2020 | 42 | 2020 |
| Extended resolution simulates DRAT B Kiesl, A Rebola-Pardo, MJH Heule International Joint Conference on Automated Reasoning, 516-531, 2018 | 42 | 2018 |
| Encoding redundancy for satisfaction-driven clause learning MJH Heule, B Kiesl, A Biere International Conference on Tools and Algorithms for the Construction and …, 2019 | 30 | 2019 |
| Super-blocked clauses B Kiesl, M Seidl, H Tompits, A Biere International Joint Conference on Automated Reasoning, 45-61, 2016 | 28 | 2016 |
| Clone detection in secure messaging: improving post-compromise security in practice C Cremers, J Fairoze, B Kiesl, A Naska Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications …, 2020 | 26 | 2020 |
| Blocked clauses in first-order logic B Kiesl, M Suda, M Seidl, H Tompits, A Biere arXiv preprint arXiv:1702.00847, 2017 | 18 | 2017 |
| A little blocked literal goes a long way B Kiesl, MJH Heule, M Seidl International Conference on Theory and Applications of Satisfiability …, 2017 | 15 | 2017 |
| A unifying principle for clause elimination in first-order logic B Kiesl, M Suda Automated Deduction–CADE 26: 26th International Conference on Automated …, 2017 | 15 | 2017 |
| Clausal proofs of mutilated chessboards MJH Heule, B Kiesl, A Biere NASA Formal Methods Symposium, 204-210, 2019 | 11 | 2019 |
| Truth assignments as conditional autarkies B Kiesl, MJH Heule, A Biere Automated Technology for Verification and Analysis: 17th International …, 2019 | 11 | 2019 |
| Local redundancy in SAT: generalizations of blocked clauses B Kiesl, M Seidl, H Tompits, A Biere Logical Methods in Computer Science 14, 2018 | 11 | 2018 |
| Simulating strong practical proof systems with extended resolution B Kiesl, A Rebola-Pardo, MJH Heule, A Biere Journal of Automated Reasoning 64 (7), 1247-1267, 2020 | 9 | 2020 |
| QRAT polynomially simulates For-All-Exp-Res B Kiesl, M Seidl Theory and Applications of Satisfiability Testing–SAT 2019: 22nd …, 2019 | 8* | 2019 |
| The Potential of Interference-Based Proof Systems. M Heule, B Kiesl ARCADE@ CADE, 51-54, 2017 | 8 | 2017 |
| Proofs for Incremental SAT with Inprocessing. B Kiesl-Reiter, MW Whalen FMCAD, 132-140, 2023 | 4 | 2023 |
| Unsatisfiability proofs for distributed clause-sharing SAT solvers D Michaelson, D Schreiber, MJH Heule, B Kiesl-Reiter, MW Whalen International Conference on Tools and Algorithms for the Construction and …, 2023 | 4 | 2023 |
Armin BiereProfessor of Computer Science, University of Freiburg在 informatik.uni-freiburg.de 的电子邮件经过验证
