A Comparative Study of 2QBF Algorithms

Abstract

2QBF is the problem of evaluating a Quantified Boolean Formula (QBF) with two levels of quantification. Many practical problems in sequential verification can be formulated as instances of 2QBF. Techniques that are not applicable to general QBF evaluation may be useful for 2QBF evaluation. In particular, decision order in search based algorithms may not… (More)

2 Figures and Tables

Topics

  • Presentations referencing similar topics