Dynamically Partitioning for Solving QBF

DOI10.1007/978-3-540-72788-0_22MaRDI QIDQ3612468zbMATH OpenOpenAlexFDO

Authors Horst Samulowitz, Fahiem Bacchus

Publication date 10 March 2009

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

Full work available at URL https://doi.org/10.1007/978-3-540-72788-0_22

Mathematics Subject Classification ID

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

Recommendations

• Enhancing search-based QBF solving by dynamic blocked clause elimination
• Theory and Applications of Satisfiability Testing
• Formal Methods in Computer-Aided Design
• Using SAT in QBF
• Theory and Applications of Satisfiability Testing

Cited in

(3)

• Beyond CNF: A Circuit-Based QBF Solver
• Enhancing search-based QBF solving by dynamic blocked clause elimination
• \(\mathsf{MPIDepQBF}\): towards parallel QBF solving without knowledge sharing

This page was built for publication: Dynamically Partitioning for Solving QBF

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