An algorithm to evaluate quantified Boolean formulae and its experimental evaluation
From MaRDI portal
Recommendations
- An algorithm to evaluate quantified Boolean formulae and its experimental evaluation
- Publication:4828947
- Theory and Applications of Satisfiability Testing
- Partial implicit unfolding in the Davis-Putnam procedure for quantified Boolean formulae
- A satisfiability procedure for quantified Boolean formulae
Cited in
(32)- Long distance Q-resolution with dependency schemes
- Compiling problem specifications into SAT
- An algorithm to evaluate quantified Boolean formulae and its experimental evaluation
- Conformant planning as a case study of incremental QBF solving
- The (D)QBF preprocessor HQSpre -- underlying theory and its implementation
- Exploiting structure in quantified formulas
- Failed literal detection for QBF
- Henkin quantifiers and Boolean formulae: a certification perspective of DQBF
- Theory and Applications of Satisfiability Testing
- Expansion-based QBF solving versus Q-resolution
- On Q-resolution and CDCL QBF solving
- Unified QBF certification and its applications
- Solving quantified constraint satisfaction problems
- The complexity of constraint satisfaction games and QCSP
- Soundness of \(\mathcal{Q}\)-resolution with dependency schemes
- Incremental determinization
- scientific article; zbMATH DE number 2119676 (Why is no real title available?)
- Deciding Boolean algebra with Presburger arithmetic
- Level-ordered \(Q\)-resolution and tree-like \(Q\)-resolution are incomparable
- QELL: QBF reasoning with extended clause learning and levelized SAT solving
- scientific article; zbMATH DE number 1543307 (Why is no real title available?)
- Computational methods for database repair by signed formulae
- A Unified Framework for Certificate and Compilation for QBF
- Lower bound techniques for QBF proof systems
- Partial implicit unfolding in the Davis-Putnam procedure for quantified Boolean formulae
- Value ordering for quantified CSPs
- Non-binary quantified CSP: Algorithms and modelling
- Long-distance Q-resolution with dependency schemes
- An effective algorithm for the futile questioning problem
- Backjumping for quantified Boolean logic satisfiability
- Complexity results for explanations in the structural-model approach
- Incrementally Computing Minimal Unsatisfiable Cores of QBFs via a Clause Group Solver API
This page was built for publication: An algorithm to evaluate quantified Boolean formulae and its experimental evaluation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1610666)
