Using SAT in QBF

DOI10.1007/11564751_43zbMath1153.68485OpenAlexW1480301700MaRDI QIDQ3524206

Horst Samulowitz, Fahiem Bacchus

Publication date: 9 September 2008

Published in: Principles and Practice of Constraint Programming - CP 2005 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11564751_43

Mathematics Subject Classification ID

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

Related Items

QELL: QBF Reasoning with Extended Clause Learning and Levelized SAT Solving ⋮ Failed Literal Detection for QBF ⋮ Unnamed Item ⋮ A Unified Framework for Certificate and Compilation for QBF ⋮ Q-Resolution with Generalized Axioms ⋮ Unnamed Item ⋮ Reinterpreting dependency schemes: soundness meets incompleteness in DQBF ⋮ Solving QBF with counterexample guided refinement

Uses Software

• Chaff
• Quaffle
• QUBE

This page was built for publication: Using SAT in QBF