Dependency Learning for QBF

DOI10.1613/jair.1.11529zbMath1477.68293OpenAlexW2952988220WikidataQ127639457 ScholiaQ127639457MaRDI QIDQ4968372

Tomáš Peitl, Stefan Szeider, Friedrich Slivovsky

Publication date: 12 July 2019

Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1613/jair.1.11529

zbMATH Keywords

quantified Boolean formulas (QBFs)quantified conflict-driven clause learning

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Complexity of proofs (03F20)

Related Items (6)

Understanding the Relative Strength of QBF CDCL Solvers and QBF Resolution ⋮ Towards Uniform Certification in QBF ⋮ Lower bounds for QCDCL via formula gauge ⋮ Planning with Incomplete Information in Quantified Answer Set Programming ⋮ Lower bounds for QCDCL via formula gauge ⋮ Proof complexity of symbolic QBF reasoning

This page was built for publication: Dependency Learning for QBF