In computational complexity theory, #SAT, or Sharp-SAT, a function problem related to the Boolean satisfiability problem, is the problem of countingâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2015

2015

Model counting is the task of computing the number of assignments to variables V that satisfy a given propositional theory Fâ€¦Â (More)

Is this relevant?

2014

2014

- Siyao Guo, Pavel HubÃ¡cek, Alon Rosen, Margarita Vald
- ITCS
- 2014

Rational proofs, recently introduced by Azar and Micali (STOC 2012), are a variant of interactive proofs in which the prover isâ€¦Â (More)

Is this relevant?

2014

2014

- Florent Capelli, Arnaud Durand, Stefan Mengel
- SAT
- 2014

We show that the propositional model counting problem #SAT for CNFformulas with hypergraphs that allow a disjoint branchesâ€¦Â (More)

Is this relevant?

2012

2010

2010

- Robert Ganian, Petr HlinenÃ½, Jan ObdrzÃ¡lek
- FSTTCS
- 2010

We provide a parameterized polynomial algorithm for the propositional model counting problem #SAT, the runtime of which is singleâ€¦Â (More)

Is this relevant?

2010

2010

- Tatjana Schmidt
- 2010

Zusammenfassung Abstract The Boolean conjunctive normal form (CNF) satisfiability problem, called SAT for short, gets as input aâ€¦Â (More)

Is this relevant?

Highly Cited

2009

Highly Cited

2009

- James Newsome, Stephen McCamant, Dawn Xiaodong Song
- PLAS
- 2009

The <i>channel capacity</i> of a program is a quantitative measure of the amount of control that the inputs to a program haveâ€¦Â (More)

Is this relevant?

Highly Cited

2007

Highly Cited

2007

- Marko Samer, Stefan Szeider
- LPAR
- 2007

We present algorithms for the propositional model counting problem #SAT. The algorithms utilize tree decompositions of certainâ€¦Â (More)

Is this relevant?

2007

2007

- Carlos GuillÃ©n, Aurelio LÃ³pez-LÃ³pez, Guillermo De Ita Luna
- Engineering Letters
- 2007

Counting the models of Boolean formulae is known to be intractable but pops up often in diverse areas. We focus in a restrictedâ€¦Â (More)

Is this relevant?

Highly Cited

2006

Highly Cited

2006

- Marc Thurley
- SAT
- 2006

We introduce sharpSAT, a new #SAT solver that is based on the well known DPLL algorithm and techniques from SAT and #SAT solversâ€¦Â (More)

Is this relevant?