5 citations · 7 across the 3 of their papers we have counts for
3 papers
Expansion-Based QBF Solving Without Recursion
Roderick Bloem, Nicolas Braud-Santoni, Vedad Hadzic +3
In recent years, expansion-based techniques have been shown to be very powerful in theory and practice for solving quantified Boolean formulas (QBF), the extension of propositional…
QBF Solving by Counterexample-guided Expansion
Roderick Bloem, Nicolas Braud-Santoni, Vedad Hadzic
We introduce a novel generalization of Counterexample-Guided Inductive Synthesis (CEGIS) and instantiate it to yield a novel, competitive algorithm for solving Quantified Boolean F…
The Next 700 Impossibility Results in Time-Varying Graphs
Nicolas Braud-Santoni, Swan Dubois, Mohamed-Hamza Kaaouachi +1
We address highly dynamic distributed systems modeled by time-varying graphs (TVGs). We interest in proof of impossibility results that often use informal arguments about convergen…