Abstraction-Based Algorithm for 2QBF
DOI10.1007/978-3-642-21581-0_19zbMATH Open1330.68115OpenAlexW147950966MaRDI QIDQ3007686FDOQ3007686
Joao Marques-Silva, Mikoláš Janota
Publication date: 17 June 2011
Published in: Theory and Applications of Satisfiability Testing - SAT 2011 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-21581-0_19
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Analysis of algorithms and problem complexity (68Q25) Classical propositional logic (03B05)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Theory and Applications of Satisfiability Testing
- sQueezeBF: An Effective Preprocessor for QBFs Based on Equivalence Reasoning
- Formal Methods in Computer-Aided Design
- A structure-preserving clause form translation
- The minimum equivalent DNF problem and shortest implicants
- Efficiently solving quantified bit-vector formulas
- Counterexample-guided abstraction refinement for symbolic model checking
- Counterexample Guided Abstraction Refinement Algorithm for Propositional Circumscription
- Theory and Applications of Satisfiability Testing
- Solving satisfiability problems with preferences
- The Seventh QBF Solvers Evaluation (QBFEVAL’10)
- Computer Aided Verification
- Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete
- Theory and applications of satisfiability testing -- SAT 2010. 13th international conference, SAT 2010, Edinburgh, UK, July 11--14, 2010. Proceedings
- SAT-based planning in complex domains: Concurrency, constraints and nondeterminism
- A satisfiability procedure for quantified Boolean formulae
- Encoding nested Boolean functions as quantified Boolean formulas
- Theory and Applications of Satisfiability Testing
- Theory and applications of satisfiability testing. 6th international conference, SAT 2003, Santa Margherita Ligure, Italy, May 5--8, 2003. Selected revised papers
Cited In (16)
- Solving QBF with counterexample guided refinement
- Symmetry in Gardens of Eden
- Computational complexity of flat and generic assumption-based argumentation, with and without probabilities
- Quantified maximum satisfiability
- The 2016 and 2017 QBF solvers evaluations (QBFEVAL'16 and QBFEVAL'17)
- Understanding and extending incremental determinization for 2QBF
- Refutation-based synthesis in SMT
- Expansion-based QBF solving versus Q-resolution
- Synchronous counting and computational algorithm design
- Complexity-sensitive decision procedures for abstract argumentation
- Two SAT solvers for solving quantified Boolean formulas with an arbitrary number of quantifier alternations
- Backdoors to tractable answer set programming
- Incremental Determinization
- 2QBF: Challenges and Solutions
- Never trust your solver: certification for SAT and QBF
- QELL: QBF Reasoning with Extended Clause Learning and Levelized SAT Solving
Uses Software
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)
