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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
While the union bound does not need any assumption on the independence of A1, . . . , An at all, it is a very weak bound, i.e… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2005
Highly Cited
2005
We describe a software error-detection tool that exploits recent advances in boolean satisfiability (SAT) solvers. Our analysis… (More)
  • figure 4
  • figure 5
  • figure 7
  • table 1
  • table 2
Is this relevant?
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… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
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… (More)
  • figure 3
  • figure 5
Is this relevant?
Highly Cited
2001
Highly Cited
2001
One of the most important features of current state-of-the-art SAT solvers is the use of conflict based backtracking and learning… (More)
  • figure 2
  • figure 1
  • figure 3
  • figure 4
  • table 1
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Satisfiability problems and probabilistic models are core topics of artificial intelligence and computer science. This paper… (More)
  • figure 5
  • figure 14
Is this relevant?
Highly Cited
1999
Highly Cited
1999
ÐThis paper introduces GRASP (Generic seaRch Algorithm for the Satisfiability Problem), a new search algorithm for Propositional… (More)
Is this relevant?
Highly Cited
1996
Highly Cited
1996
We report results from large-scale experiments in satisfiability testing. As has been observed by others, testing the… (More)
  • figure 2
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
1992
Highly Cited
1992
This article describes the Boolean satis ability method for generating test patterns for single stuck at faults in combinational… (More)
  • figure 2
  • figure 1
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
1990
Highly Cited
1990
We describe an algorithm for the satisfiability problem of prepositional logic, which is significantly more efficient for this… (More)
  • figure 1
  • table 1
  • table 2
  • table 3
  • table 4
Is this relevant?