| DepQBF: A dependency-aware QBF solver F Lonsing, A Biere Journal on Satisfiability, Boolean Modeling and Computation 7 (2-3), 71-76, 2010 | 185 | 2010 |
| Blocked clause elimination for QBF A Biere, F Lonsing, M Seidl International Conference on Automated Deduction, 101-115, 2011 | 158 | 2011 |
| Automated testing and debugging of SAT and QBF solvers R Brummayer, F Lonsing, A Biere Theory and Applications of Satisfiability Testing–SAT 2010: 13th …, 2010 | 127 | 2010 |
| Clause elimination for SAT and QSAT M Heule, M Järvisalo, F Lonsing, M Seidl, A Biere Journal of Artificial Intelligence Research 53, 127-168, 2015 | 90 | 2015 |
| DepQBF 6.0: A Search-Based QBF Solver Beyond Traditional QCDCL F Lonsing, U Egly International Conference on Automated Deduction (CADE-26) 10395, 371-384, 2017 | 80 | 2017 |
| Integrating dependency schemes in search-based QBF solvers F Lonsing, A Biere International Conference on Theory and Applications of Satisfiability …, 2010 | 74 | 2010 |
| Resolution-Based Certificate Extraction for QBF: (Tool Presentation) A Niemetz, M Preiner, F Lonsing, M Seidl, A Biere International Conference on Theory and Applications of Satisfiability …, 2012 | 72 | 2012 |
| Nenofex: Expanding NNF for QBF solving F Lonsing, A Biere International Conference on Theory and Applications of Satisfiability …, 2008 | 70 | 2008 |
| Long-distance resolution: Proof generation and strategy extraction in search-based QBF solving U Egly, F Lonsing, M Widl Logic for Programming, Artificial Intelligence, and Reasoning: 19th …, 2013 | 69 | 2013 |
| Enhancing search-based QBF solving by dynamic blocked clause elimination F Lonsing, F Bacchus, A Biere, U Egly, M Seidl Logic for Programming, Artificial Intelligence, and Reasoning: 20th …, 2015 | 44 | 2015 |
| Dependency Schemes and Search-Based QBF Solving: Theory and Practice F Lonsing Johannes Kepler University, Linz, Austria, 2012 | 43 | 2012 |
| BTOR: bit-precise modelling of word-level problems for model checking R Brummayer, A Biere, F Lonsing Proceedings of the joint workshops of the 6th international workshop on …, 2008 | 43 | 2008 |
| SAT-based methods for circuit synthesis R Bloem, U Egly, P Klampfl, R Konighofer, F Lonsing 2014 Formal Methods in Computer-Aided Design (FMCAD), 31-34, 2014 | 40 | 2014 |
| Pono: A Flexible and Extensible SMT-Based Model Checker M Mann, A Irfan, F Lonsing, Y Yang, H Zhang, K Brown, A Gupta, C Barrett International Conference on Computer Aided Verification, 461-474, 2021 | 39 | 2021 |
| Conformant planning as a case study of incremental QBF solving U Egly, M Kronegger, F Lonsing, A Pfandler Annals of Mathematics and Artificial Intelligence 80, 21-45, 2017 | 37 | 2017 |
| qbf2epr: A Tool for Generating EPR Formulas from QBF. M Seidl, F Lonsing, A Biere PAAR@ IJCAR 21, 139-148, 2012 | 37 | 2012 |
| Quantified boolean formulas O Beyersdorff, M Janota, F Lonsing, M Seidl Handbook of Satisfiability, 1177-1221, 2021 | 36 | 2021 |
| Q-Resolution with Generalized Axioms F Lonsing, U Egly, M Seidl Theory and Applications of Satisfiability Testing (SAT 2016) 9710, 435--452, 2016 | 33 | 2016 |
| The QBF gallery: Behind the scenes F Lonsing, M Seidl, A Van Gelder Artificial Intelligence 237, 92-114, 2016 | 31 | 2016 |
| Efficient clause learning for quantified Boolean formulas via QBF pseudo unit propagation F Lonsing, U Egly, A Van Gelder International Conference on Theory and Applications of Satisfiability …, 2013 | 30 | 2013 |
Armin BiereProfessor of Computer Science, University of Freiburg在 informatik.uni-freiburg.de 的电子邮件经过验证
