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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
State-of-the-art algorithms for hard computational problems often expose many parameters that can be modified to improve… 
Highly Cited
2006
Highly Cited
2006
Given a Boolean formula, do its solutions form a connected subgraph of the hypercube? This and other related connectivity… 
Highly Cited
2005
Highly Cited
2005
Recent advances in Boolean satisfiability have made it an attractive engine for solving many digital very-large-scale-integration… 
Highly Cited
2003
Highly Cited
2003
In this paper, we address the encoding into CNF clauses of Boolean cardinality constraints that arise in many practical… 
Highly Cited
2003
Highly Cited
2003
In this article, we present a small, complete, and efficient SAT-solver in the style of conflict-driven learning, as exemplified… 
Highly Cited
2002
Highly Cited
2002
The classical NP-complete problem of Boolean Satisfiability (SAT) has seen much interest in not just the theoretical computer… 
Highly Cited
2002
Highly Cited
2002
Many tasks in computer-aided design (CAD), such as equivalence checking, property checking, logic synthesis, and false paths… 
Highly Cited
1999
Highly Cited
1999
Symbolic Model Checking [3, 14] has proven to be a powerful technique for the verification of reactive systems. BDDs [2] have… 
Highly Cited
1999
Highly Cited
1999
This paper introduces GRASP (Generic seaRch Algorithm for the Satisfiability Problem), a new search algorithm for Propositional… 
Highly Cited
1978
Highly Cited
1978
The problem of deciding whether a given propositional formula in conjunctive normal form is satisfiable has been widely studied…