A Symbolic Search Based Approach for Quantified Boolean Formulas

Audemard, Gilles; Saïs, Lakhdar

doi:10.1007/11499107_2

Cited by 7 publications

(13 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…qbfbdd by Gilles Audemard and Lakhdar Saïs, uses a combination of search and symbolic (BDDbased) techniques (see [7] for more details).…”

Section: Solvers and Instancesmentioning

confidence: 99%

“…In particular, while most of the participants in the previous evaluations were complete solvers extending the well-known Davis, Put-nam, Logemann, Loveland procedure (DPLL) [2,3] for propositional satisfiability (SAT), in this evaluation only seven solvers are DPLL-based. As for the others, one is incomplete (WalkQSAT [4]), one is based on Q-resolution and expansion of quantifiers (quantor [5]), two of them use a core engine based on BDDs: zero-suppressed BDDs in QMRes [6] and standard ROBDDs in qbfbdd [7]. Finally, the solver sKizzo features a combination of the above techniques (including search) and skolemization [8].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Report of the Third QBF Solvers Evaluation1

Narizzano

Pulina

Tacchella

2006

SAT

View full text Add to dashboard Cite

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 from those available at www.qbflib.org. In the paper we present the evaluation infrastructure, from the criteria used to assemble the test set to the hardware set up, and we show different views about the results obtained, highlighting the strength of different solvers and the relative hardness of the instances included in the test set.

show abstract

“…qbfbdd by Gilles Audemard and Lakhdar Saïs, uses a combination of search and symbolic (BDDbased) techniques (see [7] for more details).…”

Section: Solvers and Instancesmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Report of the Third QBF Solvers Evaluation1

Narizzano

Pulina

Tacchella

2006

SAT

View full text Add to dashboard Cite

show abstract

“…As far as we know there are only two procedures which are based on local search: WalkQSAT [4] and QBDD(LS) [5]. Hence, most of the procedures for QBF are decision procedures which may be separated in three kinds: "monolithic" procedures which are self-sufficient, procedures with a transformation to another decision problem formalism and procedures with an oracle.…”

Section: State-of-the-art Of Sequential Qbf Solversmentioning

confidence: 99%

“…A transformation procedure interprets QBF in a different decision problem which has already efficient decision procedure: SAT (in CNF) for sKizzo [13] or ASP [14] (in those cases with an exponential growth of the formula). Procedures with an oracle come back to the initial concept of "polynomial hierarchy" since an oracle which is able to solve subproblems with smaller complexity is needed: QBDD(DLL) [5] uses an NP-complete oracle and QSAT [15] uses both NP-complete and co-NPcomplete oracles. This latter procedure is detailed in section 5 since the instantiation of our parallel model uses QSAT.…”

Section: State-of-the-art Of Sequential Qbf Solversmentioning

confidence: 99%

A new parallel architecture for QBF tools

Mota

Pichon

Stéphan

2010

2010 International Conference on High Performance Computing &Amp; Simulation

View full text Add to dashboard Cite

In this paper, we present the main lines and a first implementation of an open general parallel architecture that we propose for various computation problems about Quantified Boolean Formulae. One main feature of our approach is to deal with QBF without syntactic restrictions, as prenex form or conjunctive normal form. Another main point is to develop a general parallel framework in which we will be able in the future to introduce various specialized algorithms dedicated to particular subproblems.

show abstract

“…Auxiliary universal variables are utilized in (6) as selectors of transitions along the path: The variable α i selects the i th transition. All the combinations of transitions are considered due to the universal quantification on the auxiliary variables.…”

Section: Qbf-based Bounded Model Checkingmentioning

confidence: 99%

QBF-Based Formal Verification: Experience and Perspectives

Benedetti

Mangassarian

2008

SAT

View full text Add to dashboard Cite

The language of Quantified Boolean Formulas (QBF) has a lot of potential applications to Formal Verification (FV) tasks, as it captures many of these tasks in a natural and compact way. Practical experience has been disappointing though. When compared with contending approaches such as SAT, QBF-based FV has invariably yielded unfavorable experimental results. This paper makes two contributions. We first provide an account of the status quo in QBF-based FV. We examine commonly adopted formalizations and the relative strengths of different decision procedures. In the second part of this paper, we investigate for the first time the relevance of some advanced QBF techniques to FV tasks. In particular, we describe the use and the benefits of restricted quantifiers, QBF certificates, alternative encodings for classical model checking problems, and encodings with free variables. These promising research perspectives seem to reverse the negative standing of QBF applied to FV, as confirmed by the experimental evidence we discuss. Experiments are conducted by extending the publicly available solver sKizzo in several ways, and they include the first case studies where QBF compares favorably to SAT, its traditional competitor. QBF turns out to be an order of magnitude faster than SAT in some tasks (e.g., automated design debugging of large circuits). Moreover, as the size of the problems grows, the SAT encodings result in excessive memory requirements leading to out-of-memory conditions, while the more compact QBF encodings continue to be manageable and solvable.

show abstract

A Symbolic Search Based Approach for Quantified Boolean Formulas

Cited by 7 publications

References 14 publications

Report of the Third QBF Solvers Evaluation1

Report of the Third QBF Solvers Evaluation1

A new parallel architecture for QBF tools

QBF-Based Formal Verification: Experience and Perspectives

Contact Info

Product

Resources

About