Two SAT solvers for solving quantified Boolean formulas with an arbitrary number of quantifier alternations - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Roderick Bloem, Nicolas Braud-Santoni, Vedad Hadzic, Uwe Egly, Florian Lonsing, Martina Seidl. Two SAT solvers for solving quantified Boolean formulas with an arbitrary number of quantifier alternations. Formal Methods in System Design, 57(2):157-177, 2021. [doi]

This author has not been identified. Look up 'Roderick Bloem' in GoogleThis author has not been identified. Look up 'Nicolas Braud-Santoni' in GoogleThis author has not been identified. Look up 'Vedad Hadzic' in GoogleThis author has not been identified. Look up 'Uwe Egly' in GoogleThis author has not been identified. Look up 'Florian Lonsing' in GoogleThis author has not been identified. It may be one of the following persons:

Martina Seidl

Look up 'Martina Seidl' in Google

runs on WebDSL