Skip to search formSkip to main contentSkip to account menu

Sharp-SAT

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

Related topics

Related topics

8 relations
Boolean satisfiability problemComputational complexity theoryConjunctive normal formCounting problem (complexity)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Computing Scores of Forwarding Schemes in Switched Networks with Probabilistic Faults
Time-triggered switched networks are a deterministic communication infrastructure used by real-time distributed embedded systems… 
2017
2017
Implementation of Tetris as a Model Counter
Solving SharpSAT problems is an important area of work. In this paper, we discuss implementing Tetris, an algorithm originally… 
Review
2014
Review
2014
Theory and Applications of Satisfiability Testing – SAT 2014
Considering the theoretical hardness of SAT, the astonishing adeptness of SAT solvers when attacking practical problems has… 
2013
2013
# SAT for Vulnerability Analysis of Security Components
Vulnerability to malicious fault attacks is an emerging concern for hardware circuits that process sensitive data. We describe a… 
2010
2010
Solving #SAT Using Extension Rules: Solving #SAT Using Extension Rules
2009
2009
Solving #SAT Using Extension Rules
#SAT problem is the extension of SAT problem. It involves counting models of a given set of proposition formulae. By using the… 
2006
2006
A Fixed-Parameter Algorithm for #SAT with Parameter Incidence Treewidth
We present an efficient fixed-parameter algorithm for #SAT parameterized by the incidence treewidth, i.e., the treewidth of the… 
2004
2004
Polynomial Classes of Boolean Formulas for Computing the Degree of Belief
Given a knowledge base Σ and a formula F both in propositional Conjunctive Form, we address the problem of designing efficient… 
2000
2000
New Results in Cutting Seriation for Approximate #SAT
The general problem discussed here concerns the approximation of the number of solutions of a boolean formula in conjunctive… 
1997
1997
Counting sat-chromosome numbers and species characterization in wild species of Chrysanthemum sensu lato by fluorescent in situ hybridization using pTa71 probe