Florian Lonsing

Available identifiers

zbMath Open lonsing.florianMaRDI QIDQ286394

List of research outcomes

Publication	Date of Publication	Type
Two SAT solvers for solving quantified Boolean formulas with an arbitrary number of quantifier alternations	2021-12-08	Paper
QRATPre+: effective QBF preprocessing via strong redundancy properties	2020-05-20	Paper
\({\textsf{QRAT}}^{+}\): generalizing QRAT by a more powerful QBF redundancy property	2018-10-18	Paper
DepQBF 6.0: a search-based QBF solver beyond traditional QCDCL	2017-09-22	Paper
Conformant planning as a case study of incremental QBF solving	2017-08-15	Paper
Q-Resolution with Generalized Axioms	2016-09-05	Paper
HordeQBF: A Modular and Massively Parallel QBF Solver	2016-09-05	Paper
The QBF Gallery: behind the scenes	2016-05-20	Paper
Automated Benchmarking of Incremental SAT and QBF Solvers	2016-01-12	Paper
Enhancing Search-Based QBF Solving by Dynamic Blocked Clause Elimination	2016-01-12	Paper
Incrementally Computing Minimal Unsatisfiable Cores of QBFs via a Clause Group Solver API	2015-11-20	Paper
Clause Elimination for SAT and QSAT	2015-08-25	Paper
MPIDepQBF: Towards Parallel QBF Solving without Knowledge Sharing	2014-09-26	Paper
Incremental QBF Solving by DepQBF	2014-09-08	Paper
Efficiently Representing Existential Dependency Sets for Expansion-based QBF Solvers	2014-07-23	Paper
Long-Distance Resolution: Proof Generation and Strategy Extraction in Search-Based QBF Solving	2014-01-17	Paper
Extended Failed-Literal Preprocessing for Quantified Boolean Formulas	2013-08-12	Paper
Efficient Clause Learning for Quantified Boolean Formulas via QBF Pseudo Unit Propagation	2013-08-05	Paper
Blocked Clause Elimination for QBF	2011-07-29	Paper
Failed Literal Detection for QBF	2011-06-17	Paper
Automated Testing and Debugging of SAT and QBF Solvers	2010-09-29	Paper
Integrating Dependency Schemes in Search-Based QBF Solvers	2010-09-29	Paper
A Compact Representation for Syntactic Dependencies in QBFs	2009-07-07	Paper
Nenofex: Expanding NNF for QBF Solving	2008-05-27	Paper

Research outcomes over time

This page was built for person: Florian Lonsing