Exploiting treewidth for projected model counting and its limits

DOI10.1007/978-3-319-94144-8_11OpenAlexW2804646084MaRDI QIDQ1656576

Johannes K. Fichte, Markus Hecher, Michael Morak, Stefan Woltran

Publication date: 10 August 2018

Full work available at URL: https://arxiv.org/abs/1805.05445

zbMATH Keywords

propositional logictree decompositionsparameterized algorithmsmulti-pass dynamic programmingprojected model counting

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Classical propositional logic (03B05) Parameterized complexity, tractability and kernelization (68Q27) 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 ⋮ Solving projected model counting by utilizing treewidth and its limits ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Definability for model counting ⋮ A multiparametric view on answer set programming ⋮ ProCount: weighted projected model counting with graded project-join trees

This page was built for publication: Exploiting treewidth for projected model counting and its limits