Skip to search formSkip to main contentSkip to account menu

Boolean satisfiability problem

Known as: Counted Boolean Satisfiability Problem, 1-in-3-SAT, 3cnf-sat 
In computer science, the Boolean Satisfiability Problem (sometimes called Propositional Satisfiability Problem and abbreviated as SATISFIABILITY or… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
Circuit designComputational complexity theoryConcolic testingConjunctive normal form

Broader (2)

Electronic design automationFormal methods

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
Modified extremal optimization for the hard maximum satisfiability problem
Based on our recent study on probability distributions for evolution in extremal optimization (EO), we propose a modified… 
Highly Cited
2010
Highly Cited
2010
Reaching Consensus on Social Networks
Research in sociology studies the effectiveness of social networks in achieving computational tasks. Typically the agents who are… 
2010
2010
Lazy Abstraction for Size-Change Termination
Size-change termination is a widely used means of proving termination where source programs are first abstracted to size-change… 
2008
2008
Efficient SAT-Based Mapping and Scheduling of Homogeneous Synchronous Dataflow Graphs for Throughput Optimization
As Moore's law comes to an end, multiprocessor systems are becoming ubiquitous in today's embedded systems design. In this paper… 
2003
2003
Discriminative adaptive training using the MPE criterion
  • L. WangP. Woodland
  • IEEE Workshop on Automatic Speech Recognition and…
  • 2003
  • Corpus ID: 1953810
The paper addresses the use of discriminative training criteria for speaker adaptive training (SAT), where both the transform… 
2003
2003
Using SAT based image computation for reachability analysis
Satisfiability procedures have shown significant promise for symbolic simulation of large circuits, hence they have been used in… 
2002
2002
Locally Strong Coherence in Inference Processes
In this paper we deal with probabilistic inference in the most general form of coherent conditional probability assessments. In… 
2000
2000
A scalable, loadable custom programmable logic device for solving Boolean satisfiability problems
This paper introduces ELVIS, a custom PLD that solves Boolean satisfiability (SAT) problems and presents a significant… 
Highly Cited
1988
Highly Cited
1988
IC qualityd and test transparency
The authors examine the question of whether fault grading is necessary and if yes, how high the single-stuck fault coverage must… 
1987
1987
A Structural Theorem that Depends Quantitatively on the Complexity of SAT
  • R. Beigel
  • Proceeding Structure in Complexity Theory
  • 1987
  • Corpus ID: 29413651
We consider the class of functions that can be computed with a bounded number of queries to a given oracle A, in a bounded amount… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)