Resolution and Expressiveness of Subclasses of Quantified Boolean Formulas and Circuits
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.
KeywordsFree Variable Truth Assignment Horn Clause Boolean Formula Boolean Circuit
Unable to display preview. Download preview PDF.