Non-prenex QBF Solving Using Abstraction

@inproceedings{Tentrup2016NonprenexQS,
  title={Non-prenex QBF Solving Using Abstraction},
  author={Leander Tentrup},
  booktitle={SAT},
  year={2016}
}
In a recent work, we introduced an abstraction based algorithm for solving quantified Boolean formulas (QBF) in prenex negation normal form (PNNF) where quantifiers are only allowed in the formula’s prefix and negation appears only in front of variables. In this paper, we present a modified algorithm that lifts the restriction on prenex quantifiers. Instead of a linear quantifier prefix, the algorithm handles treeshaped quantifier hierarchies where different branches can be solved independently… CONTINUE READING
Highly Cited
This paper has 20 citations. REVIEW CITATIONS

Similar Papers

Loading similar papers…