QBF Modeling: Exploiting Player Symmetry for Simplicity and Efficiency

DOI10.1007/11814948_35zbMath1187.68264OpenAlexW1544998733MaRDI QIDQ5756570

Carlos Ansótegui, Ashish Sabharwal, Justin W. Hart, Bart Selman, Carla P. Gomes

Publication date: 4 September 2007

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

Full work available at URL: http://hdl.handle.net/10459.1/62662

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (8)

Backdoors to Satisfaction ⋮ Small Resolution Proofs for QBF using Dependency Treewidth ⋮ Incremental Determinization ⋮ Using decomposition-parameters for QBF: mind the prefix! ⋮ A solver for QBFs in negation normal form ⋮ Resolution and Expressiveness of Subclasses of Quantified Boolean Formulas and Circuits ⋮ Beyond CNF: A Circuit-Based QBF Solver ⋮ Backdoor sets of quantified Boolean formulas

Uses Software

• Quaffle

This page was built for publication: QBF Modeling: Exploiting Player Symmetry for Simplicity and Efficiency