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.
2010
2010
Lazy Abstraction for Size-Change Termination
Size-change termination is a widely used means of proving termination where source programs are first abstracted to size-change… 
Highly Cited
2005
Highly Cited
2005
LusSy: a toolbox for the analysis of systems-on-a-chip at the transactional level
We describe a toolbox for the analysis of systems-on-a-chip described in SystemC at the transactional level. The tools are able… 
2003
2003
Using SAT based image computation for reachability analysis
Satisfiability procedures have shown significant promise for symbolic simulation of large circuits, hence they have been used in… 
Highly Cited
2001
Highly Cited
2001
A Constraint Solver and Its Application to Path Feasibility Analysis
Many testing methods are based on program paths. A well-known problem with them is that some paths are infeasible. To decide the… 
2000
2000
A scalable, loadable custom programmable logic device for solving Boolean satisfiability problems
This paper introduces ELVIS, a custom PLD that solves Boolean satisfiability (SAT) problems and presents a significant… 
Highly Cited
2000
Highly Cited
2000
Optimizing Queries on Compressed Bitmaps
OptimizingQueriesOnCompressedBitmapsSihem Amer-YahiaAT&T Labs{Researchsihem@research.att.comTheo doreJohnsonjohnsont@research.att… 
Highly Cited
1998
Highly Cited
1998
Boolean matching for large libraries
Boolean matching tackles the problem whether a subcircuit of a boolean network can be substituted by a cell from a cell library… 
Highly Cited
1998
Highly Cited
1998
Problem solving during artificial selection of self-replicating loops
1987
1987
A Structural Theorem that Depends Quantitatively on the Complexity of SAT
  • R. Beigel
  • Proceeding Structure in Complexity Theory
  • 1987
  • Corpus ID: 29413651
We consider the class of functions that can be computed with a bounded number of queries to a given oracle A, in a bounded amount… 
Highly Cited
1980
Highly Cited
1980
Recognizing Disguised NR(1) Instances of the Satisfiability Problem
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)