4 citations · 7 across the 3 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
cs.LO2016
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…
cs.LO2016
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…