Model Counting for CNF Formulas of Bounded Modular Treewidth

Paulusma, Daniël; Slivovsky, Friedrich; Szeider, Stefan

doi:10.4230/LIPIcs.STACS.2013.55

by Daniël Paulusma, Friedrich Slivovsky, Stefan Szeider

Reference:

Model Counting for CNF Formulas of Bounded Modular TreewidthDaniël Paulusma, Friedrich Slivovsky, Stefan Szeider30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany (Natacha Portier, Thomas Wilke, eds.), volume 20 of LIPIcs, pages 55-66, 2013, Leibniz-Zentrum fuer Informatik.

Bibtex Entry:

@string{lzi="Leibniz-Zentrum fuer Informatik"}
@string{lipics="LIPIcs"}
@inproceedings{PaulusmaSlivovskySzeider13,
  author       = {Dani{\"e}l Paulusma and Friedrich Slivovsky and
                  Stefan Szeider},
  title	       = {Model Counting for {CNF} Formulas of Bounded Modular
                  Treewidth},
  pages	       = {55-66},
  editor       = {Natacha Portier and Thomas Wilke},
  booktitle    = {30th International Symposium on Theoretical Aspects
                  of Computer Science, STACS 2013, February 27 - March
                  2, 2013, Kiel, Germany},
  publisher    = LZI,
  series       = LIPIcs,
  volume       = {20},
  year	       = {2013},
  doi =		{10.4230/LIPIcs.STACS.2013.55},
}