Sharp-SAT

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

Topic mentions per year

Topic mentions per year

1997-2017
02419972017

Papers overview

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)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2014
2014
Rational proofs, recently introduced by Azar and Micali (STOC 2012), are a variant of interactive proofs in which the prover is… (More)
  • table 1
  • table 2
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2014
2014
We show that the propositional model counting problem #SAT for CNFformulas with hypergraphs that allow a disjoint branches… (More)
  • table 1
  • figure 1
  • figure 2
Is this relevant?
2010
2010
We provide a parameterized polynomial algorithm for the propositional model counting problem #SAT, the runtime of which is single… (More)
  • figure 1
Is this relevant?
2010
2010
Zusammenfassung Abstract The Boolean conjunctive normal form (CNF) satisfiability problem, called SAT for short, gets as input a… (More)
  • figure 2.1
  • figure 3.1
  • figure 4.1
  • figure 4.2
  • figure 4.3
Is this relevant?
Highly Cited
2009
Highly Cited
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)
  • figure 3
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
2007
Highly Cited
2007
We present algorithms for the propositional model counting problem #SAT. The algorithms utilize tree decompositions of certain… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2007
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)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2006
Highly Cited
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)
  • table 1
  • table 2
Is this relevant?