Abstraction-based algorithm for 2QBF
From MaRDI portal
Recommendations
Cites work
- A satisfiability procedure for quantified Boolean formulae
- A structure-preserving clause form translation
- Clause/Term resolution and learning in the evaluation of quantified Boolean formulas
- Counterexample guided abstraction refinement algorithm for propositional circumscription
- Counterexample-guided abstraction refinement for symbolic model checking
- Efficiently solving quantified bit-vector formulas
- Encoding nested Boolean functions as quantified Boolean formulas
- Formal Methods in Computer-Aided Design
- scientific article; zbMATH DE number 1670775 (Why is no real title available?)
- scientific article; zbMATH DE number 1979542 (Why is no real title available?)
- scientific article; zbMATH DE number 1903356 (Why is no real title available?)
- scientific article; zbMATH DE number 2090318 (Why is no real title available?)
- scientific article; zbMATH DE number 5493266 (Why is no real title available?)
- Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete
- SAT-based planning in complex domains: Concurrency, constraints and nondeterminism
- Solving satisfiability problems with preferences
- sQueezeBF: an effective preprocessor for QBFs based on equivalence reasoning
- The minimum equivalent DNF problem and shortest implicants
- The seventh QBF solvers evaluation (QBFEVAL'10)
- Theorem proving using lazy proof explication.
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Theory and applications of satisfiability testing -- SAT 2010. 13th international conference, SAT 2010, Edinburgh, UK, July 11--14, 2010. Proceedings
- Theory and applications of satisfiability testing. 6th international conference, SAT 2003, Santa Margherita Ligure, Italy, May 5--8, 2003. Selected revised papers
Cited in
(20)- Two SAT solvers for solving quantified Boolean formulas with an arbitrary number of quantifier alternations
- Computational complexity of flat and generic assumption-based argumentation, with and without probabilities
- Refutation-based synthesis in SMT
- Abstract solvers for quantified Boolean formulas and their applications
- The 2016 and 2017 QBF solvers evaluations (QBFEVAL'16 and QBFEVAL'17)
- Expansion-based QBF solving versus Q-resolution
- Backdoors to tractable answer set programming
- Solving QBF with counterexample guided refinement
- Quantified maximum satisfiability
- Incremental determinization
- Non-prenex QBF solving using abstraction
- 2QBF: challenges and solutions
- Solving QBF with counterexample guided refinement
- Solving QBF by abstraction
- QELL: QBF reasoning with extended clause learning and levelized SAT solving
- Symmetry in Gardens of Eden
- Complexity-sensitive decision procedures for abstract argumentation
- Understanding and extending incremental determinization for 2QBF
- Never trust your solver: certification for SAT and QBF
- Synchronous counting and computational algorithm design
This page was built for publication: Abstraction-based algorithm for 2QBF
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3007686)
