Expansion-based QBF Solving on Tree Decompositions*

DOI10.3233/FI-2019-1810zbMath1415.68111OpenAlexW2948333530MaRDI QIDQ5223208

Günther Charwat, Stefan Woltran

Publication date: 17 July 2019

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2019-1810

zbMATH Keywords

dynamic programmingexpansiontreewidthQBFQSAT

Mathematics Subject Classification ID

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

Related Items (5)

Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all? ⋮ Exploiting Database Management Systems and Treewidth for Counting ⋮ Unnamed Item ⋮ Default logic and bounded treewidth ⋮ ProCount: weighted projected model counting with graded project-join trees

This page was built for publication: Expansion-based QBF Solving on Tree Decompositions*