activity
20132021
most citedDuality in STRIPS planning

3 citations · 6 across the 5 of their papers we have counts for

collaborators
Showing cs.LOShow all

6 papers · 1 filter

cs.LO2020

Layered Clause Selection for Theory Reasoning

Bernhard Gleiss, Martin Suda

Explicit theory axioms are added by a saturation-based theorem prover as one of the techniques for supporting theory reasoning. While simple and effective, adding theory axioms can…

cs.LO2019

Proceedings of the Second International Workshop on Automated Reasoning: Challenges, Applications, Directions, Exemplary Achievements

Martin Suda, Sarah Winkler

These are the post-proceedings of the second ARCADE workshop, which took place on the 26th August 2019 in Natal, Brazil, colocated with CADE-27. ARCADE stands for Automated Reasoni…

cs.LO2017

Splitting Proofs for Interpolation

Bernhard Gleiss, Laura Kovacs, Martin Suda

We study interpolant extraction from local first-order refutations. We present a new theoretical perspective on interpolation based on clearly separating the condition on logical s…

cs.LO20173 cited

Blocked Clauses in First-Order Logic

Benjamin Kiesl, Martin Suda, Martina Seidl +2

Blocked clauses provide the basis for powerful reasoning techniques used in SAT, QBF, and DQBF solving. Their definition, which relies on a simple syntactic criterion, guarantees t…

cs.LO2016

Lifting QBF Resolution Calculi to DQBF

Olaf Beyersdorff, Leroy Chew, Renate Schmidt +1

We examine the existing Resolution systems for quantified Boolean formulas (QBF) and answer the question which of these calculi can be lifted to the more powerful Dependency QBFs (…

cs.LO2016

Finding Finite Models in Multi-Sorted First Order Logic

Giles Reger, Martin Suda, Andrei Voronkov

This work extends the existing MACE-style finite model finding approach to multi-sorted first order logic. This existing approach iteratively assumes increasing domain sizes and en…