Model counting for CNF formulas of bounded modular treewidth

DOI10.4230/LIPICS.STACS.2013.55zbMATH Open1354.68131OpenAlexW2261855272MaRDI QIDQ2957871FDOQ2957871

Authors: Daniël Paulusma, Friedrich Slivovsky, Stefan Szeider 

Publication date: 30 January 2017

Full work available at URL: http://dx.doi.org/10.4230/LIPIcs.STACS.2013.55

Recommendations

• Model counting for CNF formulas of bounded modular treewidth
• Model counting for formulas of bounded clique-width
• New width parameters for SAT and \#SAT
• Counting truth assignments of formulas of bounded tree-width or clique-width
• New width parameters for model counting

zbMATH Keywords

model countingparameterized complexitysatisfiability

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cited In (6)

• Complexity and approximability of parameterized MAX-CSPs
• Solving projected model counting by utilizing treewidth and its limits
• Parameterized compilation lower bounds for restricted CNF-formulas
• Exploiting treewidth for projected model counting and its limits
• Model counting for CNF formulas of bounded modular treewidth
• Model counting for formulas of bounded clique-width

This page was built for publication: Model counting for CNF formulas of bounded modular treewidth

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2957871)