Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,047,702 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
2010
2010
Closing the Achievement Gap on ACT & SAT.
David Anderson
2010
Corpus ID: 152793959
2006
2006
FPGA programmable logic block evaluation using quantified Boolean satisfiability
Andrew C. Ling
,
Deshanand P. Singh
,
S. Brown
2006
Corpus ID: 18537531
A novel field programmable gate array (FPGA) logic synthesis technique that determines if a logic function can be implemented in…
Expand
2006
2006
A Tableau for Bundled CTL
Mark Reynolds
Journal of Logic and Computation
2006
Corpus ID: 32368100
We present a sound, complete and relatively straightforward tableau method for deciding valid formulas in the propositional…
Expand
Review
2004
Review
2004
Review of "The classical decision problem" by Egon Börger,Erich Grädel and Yuri Gurevich. Springer-Verlag 1997.
Dan A. Simovici
SIGA
2004
Corpus ID: 19854179
This book is dedicated to a comprehensive presentation of the classical decision problem of firstorder logic. The centrality of…
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
1999
1999
On Solving Optimization Problems Using Boolean Satisfiability
F. Aloul
1999
Corpus ID: 7455246
The last few years have seen significant advances in Boolean satisfiability (SAT) solving. This has lead to the successful…
Expand
1997
1997
Practical Implementations of Speaker-Adaptive Training
Spyros Matsoukas
,
Richard M. Schwartz
,
Hubert Jin
,
Long Thanh Nguyen
1997
Corpus ID: 18318805
Speaker Adaptive Training (SAT) has been shown to achieve signiicant word error reductions relative to the common Speaker…
Expand
1996
1996
Anytime algorithms for constraint satisfaction and SAT problems
R. Wallace
,
Eugene C. Freuder
SGAR
1996
Corpus ID: 8250394
The constraint satisfaction problem (CSP) is a potential area of application for anytime methods. In this work we derive anytime…
Expand
1995
1995
On the Complexity of Branching Modular Model Checking (Extended Abstract)
Orna Kupferman
,
Moshe Y. Vardi
International Conference on Concurrency Theory
1995
Corpus ID: 10095634
In modular verification the specification of a module consists of two parts. One part describes the guaranteed behavior of the…
Expand