List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Two SAT solvers for solving quantified Boolean formulas with an arbitrary number of quantifier alternations Formal Methods in System Design | 2021-12-08 | Paper |
| QRATPre+: effective QBF preprocessing via strong redundancy properties (available as arXiv preprint) | 2020-05-20 | Paper |
| \({\textsf{QRAT}}^{+}\): generalizing QRAT by a more powerful QBF redundancy property (available as arXiv preprint) | 2018-10-18 | Paper |
| DepQBF 6.0: a search-based QBF solver beyond traditional QCDCL (available as arXiv preprint) | 2017-09-22 | Paper |
| Conformant planning as a case study of incremental QBF solving Annals of Mathematics and Artificial Intelligence | 2017-08-15 | Paper |
| Q-resolution with generalized axioms Theory and Applications of Satisfiability Testing – SAT 2016 | 2016-09-05 | Paper |
| HordeQBF: a modular and massively parallel QBF solver Theory and Applications of Satisfiability Testing – SAT 2016 | 2016-09-05 | Paper |
| The QBF Gallery: behind the scenes Artificial Intelligence | 2016-05-20 | Paper |
| Automated benchmarking of incremental SAT and QBF solvers Logic for Programming, Artificial Intelligence, and Reasoning | 2016-01-12 | Paper |
| Enhancing search-based QBF solving by dynamic blocked clause elimination Logic for Programming, Artificial Intelligence, and Reasoning | 2016-01-12 | Paper |
| Incrementally Computing Minimal Unsatisfiable Cores of QBFs via a Clause Group Solver API Lecture Notes in Computer Science | 2015-11-20 | Paper |
| Clause elimination for SAT and QSAT Journal of Artificial Intelligence Research | 2015-08-25 | Paper |
| \(\mathsf{MPIDepQBF}\): towards parallel QBF solving without knowledge sharing Lecture Notes in Computer Science | 2014-09-26 | Paper |
| Incremental QBF solving by DepQBF Mathematical Software – ICMS 2014 | 2014-09-08 | Paper |
| Efficiently representing existential dependency sets for expansion-based QBF solvers Electronic Notes in Theoretical Computer Science | 2014-07-23 | Paper |
| Long-distance resolution: proof generation and strategy extraction in search-based QBF solving Logic for Programming, Artificial Intelligence, and Reasoning | 2014-01-17 | Paper |
| Extended Failed-Literal Preprocessing for Quantified Boolean Formulas Theory and Applications of Satisfiability Testing – SAT 2012 | 2013-08-12 | Paper |
| Efficient Clause Learning for Quantified Boolean Formulas via QBF Pseudo Unit Propagation Theory and Applications of Satisfiability Testing – SAT 2013 | 2013-08-05 | Paper |
| Blocked clause elimination for QBF Lecture Notes in Computer Science | 2011-07-29 | Paper |
| Failed literal detection for QBF Theory and Applications of Satisfiability Testing - SAT 2011 | 2011-06-17 | Paper |
| Automated testing and debugging of SAT and QBF solvers Theory and Applications of Satisfiability Testing – SAT 2010 | 2010-09-29 | Paper |
| Integrating dependency schemes in search-based QBF solvers Theory and Applications of Satisfiability Testing – SAT 2010 | 2010-09-29 | Paper |
| A Compact Representation for Syntactic Dependencies in QBFs Lecture Notes in Computer Science | 2009-07-07 | Paper |
| Nenofex: Expanding NNF for QBF Solving Theory and Applications of Satisfiability Testing – SAT 2008 | 2008-05-27 | Paper |
Research outcomes over time
This page was built for person: Florian Lonsing
