Beyond CNF: A Circuit-Based QBF Solver

DOI10.1007/978-3-642-02777-2_38zbMath1247.68236OpenAlexW2036901448MaRDI QIDQ3637177

Alexandra Goultiaeva, Vicki Iverson, Fahiem Bacchus

Publication date: 7 July 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02777-2_38

Mathematics Subject Classification ID

Related Items (5)

Unnamed Item ⋮ Efficiently solving quantified bit-vector formulas ⋮ Non-prenex QBF Solving Using Abstraction ⋮ CirQit2 ⋮ CAQE and QuAbS: Abstraction Based QBF Solvers

Uses Software

• QuBE++
• QBFLIB
• QUBE
• QuteSAT
• Quantor
• sKizzo

Cites Work

• Unnamed Item
• A solver for QBFs in negation normal form
• Dynamically Partitioning for Solving QBF
• Automated Deduction – CADE-20
• A Computing Procedure for Quantification Theory
• Theory and Applications of Satisfiability Testing
• Solving Quantified Boolean Formulas with Circuit Observability Don’t Cares
• QBF Modeling: Exploiting Player Symmetry for Simplicity and Efficiency
• Principles and Practice of Constraint Programming – CP 2004

This page was built for publication: Beyond CNF: A Circuit-Based QBF Solver