Backdoor Sets of Quantified Boolean Formulas

DOI10.1007/978-3-540-72788-0_23MaRDI QIDQ3612469zbMATH OpenOpenAlexFDO

Authors Marko Samer, Stefan Szeider

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_23

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Backdoor sets of quantified Boolean formulas
• Backdoors to satisfaction
• Backdoors to q-Horn
• Backdoors to q-Horn
• Backdoors into two occurrences

Cited in

(6)

• Backdoors to q-Horn
• Backdoor sets of quantified Boolean formulas
• Theory and Applications of Satisfiability Testing
• A generalized back-door criterion
• Backdoors to q-Horn
• Backjumping for quantified Boolean logic satisfiability

This page was built for publication: Backdoor Sets of Quantified Boolean Formulas

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