Hypergraph Acyclicity and Propositional Model Counting

  • Florent Capelli
  • Arnaud Durand
  • Stefan Mengel
Conference paper

DOI: 10.1007/978-3-319-09284-3_29

Part of the Lecture Notes in Computer Science book series (LNCS, volume 8561)
Cite this paper as:
Capelli F., Durand A., Mengel S. (2014) Hypergraph Acyclicity and Propositional Model Counting. In: Sinz C., Egly U. (eds) Theory and Applications of Satisfiability Testing – SAT 2014. SAT 2014. Lecture Notes in Computer Science, vol 8561. Springer, Cham

Abstract

We show that the propositional model counting problem #SAT for CNF-formulas with hypergraphs that allow a disjoint branches decomposition can be solved in polynomial time. We show that this class of hypergraphs is incomparable to hypergraphs of bounded incidence cliquewidth which were the biggest class of hypergraphs for which #SAT was known to be solvable in polynomial time so far. Furthermore, we present a polynomial time algorithm that computes a disjoint branches decomposition of a given hypergraph if it exists and rejects otherwise. Finally, we show that some slight extensions of the class of hypergraphs with disjoint branches decompositions lead to intractable #SAT, leaving open how to generalize the counting result of this paper.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Florent Capelli
    • 1
  • Arnaud Durand
    • 1
    • 2
  • Stefan Mengel
    • 3
  1. 1.IMJ UMR 7586 - LogiqueUniversité Paris DiderotFrance
  2. 2.LSV UMR 8643ENS CachanFrance
  3. 3.Laboratoire d’Informatique, LIX UMR 7161Ecole PolytechniqueFrance

Personalised recommendations