47 citations · 188 across the 18 of their papers we have counts for
Showing 2015Show all
3 papers · 1 filter
cs.LO2015★ 23 cited
The QBF Gallery: Behind the Scenes
Florian Lonsing, Martina Seidl, Allen Van Gelder
Over the last few years, much progress has been made in the theory and practice of solving quantified Boolean formulas (QBF). Novel solvers have been presented that either successf…
cs.LO2015★ 1 cited
Automated Benchmarking of Incremental SAT and QBF Solvers
Uwe Egly, Florian Lonsing, Johannes Oetsch
Incremental SAT and QBF solving potentially yields improvements when sequences of related formulas are solved. An incremental application is usually tailored towards some specific…
cs.LO2015★ 6 cited
Incrementally Computing Minimal Unsatisfiable Cores of QBFs via a Clause Group Solver API
Florian Lonsing, Uwe Egly
We consider the incremental computation of minimal unsatisfiable cores (MUCs) of QBFs. To this end, we equipped our incremental QBF solver DepQBF with a novel API to allow for incr…