6 citations · 11 across the 13 of their papers we have counts for
Showing cs.LOShow all
2 papers · 1 filter
cs.LO2026
Quantifier Elimination Meets Treewidth
Hao Wu, Jiyu Zhu, Amir Kafshdar Goharshady +3
In this paper, we address the complexity barrier inherent in Fourier-Motzkin elimination (FME) and cylindrical algebraic decomposition (CAD) when eliminating a block of (existentia…
cs.LO2019★ 1 cited
NIL: Learning Nonlinear Interpolants
Mingshuai Chen, Jian Wang, Jie An +3
Nonlinear interpolants have been shown useful for the verification of programs and hybrid systems in contexts of theorem proving, model checking, abstract interpretation, etc. The…