Taming high treewidth with abstraction, nested dynamic programming, and database technology

DOI10.1007/978-3-030-51825-7_25OpenAlexW3040346023MaRDI QIDQ2661361

Patrick Thier, Markus Hecher, Stefan Woltran

Publication date: 7 April 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-51825-7_25

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational aspects of satisfiability (68R07)

Related Items (8)

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 ⋮ Generating random instances of weighted model counting. An empirical analysis with varying primal treewidth ⋮ Solving projected model counting by utilizing treewidth and its limits ⋮ A practical account into counting Dung's extensions by dynamic programming ⋮ Default logic and bounded treewidth ⋮ Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs ⋮ ProCount: weighted projected model counting with graded project-join trees

Uses Software

• PicoSAT
• sharpSAT
• htd
• Dsharp
• GANAK

This page was built for publication: Taming high treewidth with abstraction, nested dynamic programming, and database technology