The Random Modal QBF Test Set
نویسندگان
چکیده
Abstract. We provide an empirical evaluation of one of the main test sets that is currently in use for testing modal satisfiability solvers, viz. the random modal QBF test set. We first discuss some of the background underlying the test set, and then evaluate the test set using criteria set forth by Horrocks, Patel-Schneider, and Sebastiani. We also present some guidelines for the use of the test set.
منابع مشابه
Symbolic Decision Procedures for QBF
Much recent work has gone into adapting techniques that were originally developed for SAT solving to QBF solving. In particular, QBF solvers are often based on SAT solvers. Most competitive QBF solvers are search-based. In this work we explore an alternative approach to QBF solving, based on symbolic quantifier elimination. We extend some recent symbolic approaches for SAT solving to symbolic Q...
متن کاملUnsatisfying Walks: Solving False QBFs with Local Search
In the past few years, we have seen significant progress in the area of Boolean satisfiability (SAT) solving and its applications. More recently, new efforts have focused on developing solvers for Quantified Boolean Formulas (QBFs). Recent QBF evaluation results show that developing practical QBF solvers is more challenging than one might expect. Even relatively small QBF problems are sometimes...
متن کاملFinding Small Unsatisfiable Cores to Prove Unsatisfiability of QBFs
In the past few years, we have seen significant progress in the area of Boolean satisfiability (SAT) solving and its applications. More recently, new efforts have focused on developing solvers for Quantified Boolean Formulas (QBFs). Recent QBF evaluation results show that developing practical QBF solvers is more challenging than one might expect. Even relatively small QBF problems are sometimes...
متن کاملReport of the Third QBF Solvers Evaluation
This paper reports about the 2005 comparative evaluation of solvers for quantified Boolean formulas (QBFs), the third in a series of non-competitive events established with the aim of assessing the advancements in the field of QBF reasoning and related research. We evaluated thirteen solvers on a test set of more than three thousands QBFs, selected from instances submitted to the evaluation and...
متن کاملThe Second QBF Solvers Comparative Evaluation
This paper reports about the 2004 comparative evaluation of solvers for quantified Boolean formulas (QBFs), the second in a series of non-competitive events established with the aim of assessing the advancements in the field of QBF reasoning and related research. We evaluated sixteen solvers on a test set of about one thousand benchmarks, selected from instances submitted to the evaluation and ...
متن کامل