2QBF: Challenges and Solutions

DOI10.1007/978-3-319-40970-2_28zbMath1475.68335OpenAlexW2489897814MaRDI QIDQ2818033

Alan Mishchenko, Christoph Scholl, Jie-Hong R. Jiang, Valeriy Balabanov, Robert K. Brayton

Publication date: 5 September 2016

Published in: Theory and Applications of Satisfiability Testing – SAT 2016 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-40970-2_28

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (2)

Two SAT solvers for solving quantified Boolean formulas with an arbitrary number of quantifier alternations ⋮ CAQE and QuAbS: Abstraction Based QBF Solvers

Uses Software

• MiniSat
• QuBE++
• Bloqqer
• DepQBF
• QUBE
• sKizzo
• RAReQS
• QESTO

Cites Work

• Unnamed Item
• An effective algorithm for the futile questioning problem
• Unified QBF certification and its applications
• Solving QBF with Counterexample Guided Refinement
• Faster Extraction of High-Level Minimal Unsatisfiable Cores
• Abstraction-Based Algorithm for 2QBF
• Blocked Clause Elimination for QBF
• Theory and Applications of Satisfiability Testing
• Theory and Applications of Satisfiability Testing
• Automated Deduction – CADE-20
• Formal Methods in Computer-Aided Design

This page was built for publication: 2QBF: Challenges and Solutions