Resolution and Expressiveness of Subclasses of Quantified Boolean Formulas and Circuits

Authors:
Hans Kleine Büning;Xishun Zhao;Uwe Bubeck
Affiliations:
Universität Paderborn, Germany;Sun Yat-sen University Guangzhou, PR China;Universität Paderborn, Germany
Venue:
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Year:
2009

Citing 6
Cited 1

Resolution for quantified Boolean formulas

Information and Computation
On the Computational Complexity of Quantified Horn Clauses

CSL '87 Proceedings of the 1st Workshop on Computer Science Logic
Subclasses of Quantified Boolean Formulas

CSL '90 Proceedings of the 4th Workshop on Computer Science Logic
Models and quantifier elimination for quantified Horn formulas

Discrete Applied Mathematics
Nenofex: expanding NNF for QBF solving

SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
QBF modeling: exploiting player symmetry for simplicity and efficiency

SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing

Rewriting (dependency-)quantified 2-CNF with arbitrary free literals into existential 2-HORN

SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an extension of Q-Unit resolution for formulas that are not completely in clausal form. This b-unit resolution is applied to different classes of quantified Boolean formulas in which the existential and universal variables satisfy the Horn property. These formulas are transformed into propositional equivalents consisting of only polynomially many subformulas. We obtain compact encodings as Boolean circuits and show that both representations have the same expressive power.