4 citations · 7 across the 2 of their papers we have counts for
4 papers
New ways to multiply 3 x 3-matrices
Marijn J. H. Heule, Manuel Kauers, Martina Seidl
It is known since the 1970s that no more than 23 multiplications are required for computing the product of two 3 x 3-matrices. It is not known whether this can also be done with fe…
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…
Q-Resolution with Generalized Axioms
Florian Lonsing, Uwe Egly, Martina Seidl
Q-resolution is a proof system for quantified Boolean formulas (QBFs) in prenex conjunctive normal form (PCNF) which underlies search-based QBF solvers with clause and cube learnin…
Satisfiability-Based Methods for Reactive Synthesis from Safety Specifications
Roderick Bloem, Uwe Egly, Patrick Klampfl +3
Existing approaches to synthesize reactive systems from declarative specifications mostly rely on Binary Decision Diagrams (BDDs), inheriting their scalability issues. We present n…