QBF Modeling: Exploiting Player Symmetry for Simplicity and Efficiency

DOI10.1007/11814948_35MaRDI QIDQ5756570zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• Symmetry in \(n\)-player games
• Improving Discrete Model Representations via Symmetry Considerations
• Positional games and QBF: the corrective encoding
• Exploiting symmetries within constraint satisfaction search
• Proof complexity of QBF symmetry recomputation
• QQ plots for assessing symmetry models
• Quasipolynomial set-based symbolic algorithms for parity games
• Symmetries and the complexity of pure Nash equilibrium
• A simple algorithm for solving qualitative probabilistic parity games
• Symmetry in concurrent games

Cited in

(11)

• A solver for QBFs in negation normal form
• Backdoor sets of quantified Boolean formulas
• Symmetries of quantified Boolean formulas
• Using decomposition-parameters for QBF: mind the prefix!
• Incremental determinization
• Backdoors to satisfaction
• Small resolution proofs for QBF using dependency treewidth
• Resolution and Expressiveness of Subclasses of Quantified Boolean Formulas and Circuits
• Beyond CNF: A Circuit-Based QBF Solver
• Recovering and utilizing partial duality in QBF
• Quantified Boolean Solving for Achievement Games

Describes a project that uses

Uses Software

• Quaffle

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

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