Search Results for author: Florian Lonsing

Found 5 papers, 3 papers with code

QRATPre+: Effective QBF Preprocessing via Strong Redundancy Properties

1 code implementation29 Apr 2019 Florian Lonsing, Uwe Egly

QRATPre+ is the first implementation of these redundancy properties in QRAT and QRAT+ used to simplify QBFs in preprocessing.

Logic in Computer Science

QRAT+: Generalizing QRAT by a More Powerful QBF Redundancy Property

1 code implementation9 Apr 2018 Florian Lonsing, Uwe Egly

We generalize the redundancy property in the QRAT system by QBF specific UP (QUP).

Logic in Computer Science

HordeQBF: A Modular and Massively Parallel QBF Solver

no code implementations13 Apr 2016 Tomas Balyo, Florian Lonsing

The recently developed massively parallel satisfiability (SAT) solver HordeSAT was designed in a modular way to allow the integration of any sequential CDCL-based SAT solver in its core.

Incrementally Computing Minimal Unsatisfiable Cores of QBFs via a Clause Group Solver API

1 code implementation9 Feb 2015 Florian Lonsing, Uwe Egly

To this end, we equipped our incremental QBF solver DepQBF with a novel API to allow for incremental solving based on clause groups.

Logic in Computer Science

Conformant Planning as a Case Study of Incremental QBF Solving

no code implementations28 May 2014 Uwe Egly, Martin Kronegger, Florian Lonsing, Andreas Pfandler

Our results are the first empirical study of incremental QBF solving in the context of planning and motivate its use in other application domains.

Cannot find the paper you are looking for? You can Submit a new open access paper.