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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2006
Highly Cited
2006
In this paper, we describe and evaluate three dieren t techniques for translating pseudoboolean constraints (linear constraints… Expand
  • figure 2
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Recent advances in Boolean satisfiability have made it attractive to solve many digital VLSI design problems such as verification… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • 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… Expand
  • figure 2
  • figure 1
  • figure 3
  • figure 4
  • table 1
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… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • table 1
Is this relevant?
Highly Cited
1996
Highly Cited
1996
This paper introduces GRASP (Generic seaRch Algorithm for the Satisfiability Problem), an integrated algorithmic framework for… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Is this relevant?
Highly Cited
1992
Highly Cited
1992
  • Tracy Larrabee
  • IEEE Trans. on CAD of Integrated Circuits and…
  • 1992
  • Corpus ID: 206439496
The author describes the Boolean satisfiability method for generating test patterns for single stuck-at faults in combinational… Expand
  • figure I
  • figure I
  • figure I
Is this relevant?
Highly Cited
1984
Highly Cited
1984
New algorithms for deciding whether a (propositional) Horn formula is satisfiable are presented. If the Horn formula A contains K… Expand
Is this relevant?
Highly Cited
1984
Highly Cited
1984
3-SAT is NP-complete when restricted to instances where each variable appears in at most four clauses. When no variable appears… Expand
Is this relevant?
Highly Cited
1979
Highly Cited
1979
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
Is this relevant?
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… Expand
Is this relevant?