Recovering and utilizing partial duality in QBF

DOI10.1007/978-3-642-39071-5_8MaRDI QIDQ5326455zbMATH OpenOpenAlexFDO

Authors Alexandra Goultiaeva, Fahiem Bacchus

Publication date 5 August 2013

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

Full work available at URL https://doi.org/10.1007/978-3-642-39071-5_8

Mathematics Subject Classification ID

Recommendations

• QBF Modeling: Exploiting Player Symmetry for Simplicity and Efficiency
• Beyond CNF: A Circuit-Based QBF Solver
• Exploiting circuit representations in QBF solving
• A non-prenex, non-clausal QBF solver with game-state learning
• Theory and Applications of Satisfiability Testing

Cited in

(6)

• Quantified maximum satisfiability
• Incremental determinization
• The QBF Gallery: behind the scenes
• QELL: QBF reasoning with extended clause learning and levelized SAT solving
• GhostQ. System description
• Runtime vs. extracted proof size: an exponential gap for CDCL on QBFs

Describes a project that uses

Uses Software

• Bloqqer
• QBFLIB
• DepQBF

This page was built for publication: Recovering and utilizing partial duality in QBF

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5326455)