An Empirical Study of QBF Encodings: from Treewidth Estimation to Useful Preprocessing

Abstract

From an empirical point of view, the hardness of quantified Boolean formulas (QBFs), can be characterized by the (in)ability of current state-of-the-art QBF solvers to decide about the truth of formulas given limited computational resources. In this paper, we start from the problem of computing empirical hardness markers, i.e., features that can… (More)
DOI: 10.3233/FI-2010-312

16 Figures and Tables

Topics

  • Presentations referencing similar topics