6 citations · 12 across the 10 of their papers we have counts for
3 papers · 1 filter
Engineering an Efficient Boolean Functional Synthesis Engine
Priyanka Golia, Friedrich Slivovsky, Subhajit Roy +1
Given a Boolean specification between a set of inputs and outputs, the problem of Boolean functional synthesis is to synthesise each output as a function of inputs such that the sp…
Certified DQBF Solving by Definition Extraction
Franz-Xaver Reichl, Friedrich Slivovsky, Stefan Szeider
We propose a new decision procedure for dependency quantified Boolean formulas (DQBF) that uses interpolation-based definition extraction to compute Skolem functions in a counter-e…
Proof Complexity of Symbolic QBF Reasoning
Stefan Mengel, Friedrich Slivovsky
We introduce and investigate symbolic proof systems for Quantified Boolean Formulas (QBF) operating on Ordered Binary Decision Diagrams (OBDDs). These systems capture QBF solvers t…