Theory and Applications of Satisfiability Testing

DOI10.1007/b95238zbMath1204.03017OpenAlexW2494235144WikidataQ56039662 ScholiaQ56039662MaRDI QIDQ5325853

Hans Kleine Büning, Zhao, Xishun, K. Subramani and Vahan Mkrtchyan

Publication date: 24 July 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b95238

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Classical propositional logic (03B05)

Related Items

Boolean functions as models for quantified Boolean formulas ⋮ Models and quantifier elimination for quantified Horn formulas ⋮ Computational complexity of quantified Boolean formulas with fixed maximal deficiency