Florian Lonsing

From MaRDI portal
Person:286394

Available identifiers

zbMath Open lonsing.florianMaRDI QIDQ286394

List of research outcomes





PublicationDate of PublicationType
Two SAT solvers for solving quantified Boolean formulas with an arbitrary number of quantifier alternations2021-12-08Paper
QRATPre+: effective QBF preprocessing via strong redundancy properties2020-05-20Paper
\({\textsf{QRAT}}^{+}\): generalizing QRAT by a more powerful QBF redundancy property2018-10-18Paper
DepQBF 6.0: a search-based QBF solver beyond traditional QCDCL2017-09-22Paper
Conformant planning as a case study of incremental QBF solving2017-08-15Paper
Q-resolution with generalized axioms2016-09-05Paper
HordeQBF: a modular and massively parallel QBF solver2016-09-05Paper
The QBF Gallery: behind the scenes2016-05-20Paper
Automated benchmarking of incremental SAT and QBF solvers2016-01-12Paper
Enhancing search-based QBF solving by dynamic blocked clause elimination2016-01-12Paper
Incrementally Computing Minimal Unsatisfiable Cores of QBFs via a Clause Group Solver API2015-11-20Paper
Clause elimination for SAT and QSAT2015-08-25Paper
\(\mathsf{MPIDepQBF}\): towards parallel QBF solving without knowledge sharing2014-09-26Paper
Incremental QBF solving by DepQBF2014-09-08Paper
Efficiently representing existential dependency sets for expansion-based QBF solvers2014-07-23Paper
Long-distance resolution: proof generation and strategy extraction in search-based QBF solving2014-01-17Paper
Extended Failed-Literal Preprocessing for Quantified Boolean Formulas2013-08-12Paper
Efficient Clause Learning for Quantified Boolean Formulas via QBF Pseudo Unit Propagation2013-08-05Paper
Blocked clause elimination for QBF2011-07-29Paper
Failed literal detection for QBF2011-06-17Paper
Automated testing and debugging of SAT and QBF solvers2010-09-29Paper
Integrating dependency schemes in search-based QBF solvers2010-09-29Paper
A Compact Representation for Syntactic Dependencies in QBFs2009-07-07Paper
Nenofex: Expanding NNF for QBF Solving2008-05-27Paper

Research outcomes over time

This page was built for person: Florian Lonsing