Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,741,319 papers from all fields of science
Search
Sign In
Create Free Account
Boolean satisfiability problem
Known as:
Counted Boolean Satisfiability Problem
, 1-in-3-SAT
, 3cnf-sat
Expand
In computer science, the Boolean Satisfiability Problem (sometimes called Propositional Satisfiability Problem and abbreviated as SATISFIABILITY or…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
Circuit design
Computational complexity theory
Concolic testing
Conjunctive normal form
Expand
Broader (2)
Electronic design automation
Formal methods
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
Lazy Abstraction for Size-Change Termination
M. Codish
,
Carsten Fuhs
,
J. Giesl
,
Peter Schneider-Kamp
Logic Programming and Automated Reasoning
2010
Corpus ID: 799902
Size-change termination is a widely used means of proving termination where source programs are first abstracted to size-change…
Expand
Highly Cited
2005
Highly Cited
2005
LusSy: a toolbox for the analysis of systems-on-a-chip at the transactional level
M. Moy
,
F. Maraninchi
,
L. Maillet-Contoz
International Conference on Application of…
2005
Corpus ID: 2457667
We describe a toolbox for the analysis of systems-on-a-chip described in SystemC at the transactional level. The tools are able…
Expand
2003
2003
Using SAT based image computation for reachability analysis
P. Chauhan
,
E. Clarke
,
D. Kroening
2003
Corpus ID: 10967400
Satisfiability procedures have shown significant promise for symbolic simulation of large circuits, hence they have been used in…
Expand
Highly Cited
2001
Highly Cited
2001
A Constraint Solver and Its Application to Path Feasibility Analysis
Jian Zhang
,
Xiaoxu Wang
International journal of software engineering and…
2001
Corpus ID: 16881611
Many testing methods are based on program paths. A well-known problem with them is that some paths are infeasible. To decide the…
Expand
2000
2000
A scalable, loadable custom programmable logic device for solving Boolean satisfiability problems
M. J. Boyd
,
T. Larrabee
Proceedings IEEE Symposium on Field-Programmable…
2000
Corpus ID: 5841742
This paper introduces ELVIS, a custom PLD that solves Boolean satisfiability (SAT) problems and presents a significant…
Expand
Highly Cited
2000
Highly Cited
2000
Optimizing Queries on Compressed Bitmaps
S. Amer-Yahia
,
T. Johnson
Very Large Data Bases Conference
2000
Corpus ID: 572007
OptimizingQueriesOnCompressedBitmapsSihem Amer-YahiaAT&T Labs{Researchsihem@research.att.comTheo doreJohnsonjohnsont@research.att…
Expand
Highly Cited
1998
Highly Cited
1998
Boolean matching for large libraries
Uwe Hinsberger
,
Reiner Kolla
Proceedings Design and Automation Conference…
1998
Corpus ID: 2430277
Boolean matching tackles the problem whether a subcircuit of a boolean network can be substituted by a cell from a cell library…
Expand
Highly Cited
1998
Highly Cited
1998
Problem solving during artificial selection of self-replicating loops
Hui-Hsien Chou
,
J. Reggia
1998
Corpus ID: 60553884
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…
Expand
Highly Cited
1980
Highly Cited
1980
Recognizing Disguised NR(1) Instances of the Satisfiability Problem
Bengt Aspvall
J. Algorithms
1980
Corpus ID: 5296270
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)
ACCEPT & CONTINUE