Title of article
Counting truth assignments of formulas of bounded tree-width or clique-width Original Research Article
Author/Authors
E. Fischer، نويسنده , , J.A. Makowsky، نويسنده , , E.V. Ravve، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2008
Pages
19
From page
511
To page
529
Abstract
We study algorithms for image and its generalized version image, the problem of computing the number of satisfying assignments of a set of propositional clauses image. For this purpose we consider the clauses given by their incidence graph, a signed bipartite graph image, and its derived graphs image and image.
Keywords
Satisfiability (SAT) , Counting problems , Tree-width , Clique-width , Fixed parameter tractable (FPT)
Journal title
Discrete Applied Mathematics
Serial Year
2008
Journal title
Discrete Applied Mathematics
Record number
886674
Link To Document