Nested Boolean Functions as Models for Quantified Boolean Formulas

DOI10.1007/978-3-642-39071-5_20zbMath1390.68337OpenAlexW151780725MaRDI QIDQ5326469

Hans Kleine Büning, Uwe Bubeck

Publication date: 5 August 2013

Published in: Theory and Applications of Satisfiability Testing – SAT 2013 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-39071-5_20

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Classical propositional logic (03B05)

Related Items (3)

Learning Boolean specifications ⋮ Tackling universal properties of minimal trap spaces of Boolean networks ⋮ The possibilistic Horn non-clausal knowledge bases

This page was built for publication: Nested Boolean Functions as Models for Quantified Boolean Formulas