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.
2016
2016
A quantum annealing approach for Boolean Satisfiability problem
Quantum annealing device has shown a great potential in solving discrete problems that are theoretically and empirically hard… 
Highly Cited
2012
Highly Cited
2012
Optical Wireless Communications: System and Channel Modelling with MATLAB®
Detailing a systems approach, Optical Wireless Communications: System and Channel Modelling with MATLAB, is a self-contained… 
Highly Cited
2010
Highly Cited
2010
Cause clue clauses: error localization using maximum satisfiability
Much effort is spent by programmers everyday in trying to reduce long, failing execution traces to the cause of the error. We… 
Highly Cited
2009
Highly Cited
2009
Satisfiability Modulo Theories: An Appetizer
Satisfiability Modulo Theories (SMT) is about checking the satisfiability of logical formulas over one or more theories. The… 
Highly Cited
2009
Highly Cited
2009
The Complexity of Satisfiability of Small Depth Circuits
Say that an algorithm solving a Boolean satisfiability problem x on n variables is improved if it takes time poly(|x|)2 cn for… 
Highly Cited
2007
Highly Cited
2007
A Decision Procedure for Bit-Vectors and Arrays
STP is a decision procedure for the satisfiability of quantifier-free formulas in the theory of bit-vectors and arrays that has… 
2006
2006
Maximum Satisfiability
The Boolean satisfiability problem (SAT) is the problem of deciding, given a Boolean expression in variables x1, · · · , xn… 
Highly Cited
2003
Highly Cited
2003
Efficient CNF Encoding of Boolean Cardinality Constraints
In this paper, we address the encoding into CNF clauses of Boolean cardinality constraints that arise in many practical… 
Highly Cited
2002
Highly Cited
2002
Robust Boolean reasoning for equivalence checking and functional property verification
Many tasks in computer-aided design (CAD), such as equivalence checking, property checking, logic synthesis, and false paths… 
Highly Cited
2002
Highly Cited
2002
The Quest for Efficient Boolean Satisfiability Solvers
The classical NP-complete problem of Boolean Satisfiability (SAT) has seen much interest in not just the theoretical computer… 
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)