Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Related topics

Related topics

50 relations
Circuit designComputational complexity theoryConcolic testingConjunctive normal form
Expand

Broader (2)

Electronic design automationFormal methods

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
Sequential Model-Based Optimization for General Algorithm Configuration
State-of-the-art algorithms for hard computational problems often expose many parameters that can be modified to improve… Expand
  • table 1
  • figure 1
  • table 2
  • figure 2
Highly Cited
2008
Highly Cited
2008
Satisfiability Solvers
Publisher Summary The past few years have seen enormous progress in the performance of Boolean satisfiability (SAT) solvers… Expand
  • figure 1.1
  • figure 1.2
  • figure 1.3
  • figure 1.4
  • figure 1.5
Highly Cited
2006
Highly Cited
2006
The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies
Boolean satisfiability problems are an important benchmark for questions about complexity, algorithms, heuristics, and threshold… Expand
  • figure 1
  • figure 2
Highly Cited
2005
Highly Cited
2005
Fault diagnosis and logic debugging using Boolean satisfiability
Recent advances in Boolean satisfiability have made it an attractive engine for solving many digital very-large-scale-integration… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
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… Expand
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
Highly Cited
2003
Highly Cited
2003
An Extensible SAT-solver
In this article, we present a small, complete, and efficient SAT-solver in the style of conflict-driven learning, as exemplified… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
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… Expand
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 7
Highly Cited
1999
Highly Cited
1999
Symbolic Model Checking without BDDs
Symbolic Model Checking [3, 14] has proven to be a powerful technique for the verification of reactive systems. BDDs [2] have… Expand
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
Highly Cited
1979
Highly Cited
1979
A Linear-Time Algorithm for Testing the Truth of Certain Quantified Boolean Formulas
Let F = Qlxr Qzxz l ** Qnx, C be a quantified Boolean formula with no free variables, where each Qi is either 3 or t, and C is in… Expand
  • figure 1
Highly Cited
1978
Highly Cited
1978
The complexity of satisfiability problems
The problem of deciding whether a given propositional formula in conjunctive normal form is satisfiable has been widely studied… Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE