Binary Clause Reasoning in QBF

DOI10.1007/11814948_33zbMath1187.68265OpenAlexW1581900214MaRDI QIDQ5756571

Horst Samulowitz, Fahiem Bacchus

Publication date: 4 September 2007

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

Full work available at URL: https://doi.org/10.1007/11814948_33

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 (6)

Logic-based ontology comparison and module extraction, with an application to DL-Lite ⋮ Failed Literal Detection for QBF ⋮ A solver for QBFs in negation normal form ⋮ Learning to Integrate Deduction and Search in Reasoning about Quantified Boolean Formulas ⋮ Backdoor sets of quantified Boolean formulas ⋮ Solving QBF with counterexample guided refinement

This page was built for publication: Binary Clause Reasoning in QBF