Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 233,378,861 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
2007
2007
A Case for Simple SAT Solvers
Jinbo Huang
International Conference on Principles and…
2007
Corpus ID: 8561095
As SAT becomes more popular due to its ability to handle large real-world problems, progress in efficiency appears to have slowed…
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
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
Decidability by Resolution for Propositional Modal Logics
R. Schmidt
Journal of automated reasoning
1999
Corpus ID: 2264362
The paper shows that satisfiability in a range of popular propositional modal systems can be decided by ordinary resolution…
Expand
1997
1997
Practical Implementations of Speaker-Adaptive Training
Spyros Matsoukas
,
R. Schwartz
,
Hubert Jin
,
N. T. Long
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
A NN algorithm for Boolean satisfiability problems
W. Spears
International Conference on Neural Networks
1996
Corpus ID: 17891681
Satisfiability (SAT) refers to the task of finding a truth assignment that makes an arbitrary Boolean expression true. This paper…
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)
O. 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
1994
1994
The satisfiability problem in multiple-valued Horn formulae
G. Escalada-Imaz
,
F. Manyà
IEEE International Symposium on Multiple-Valued…
1994
Corpus ID: 42111440
Testing the satisfiability of propositional Horn formulae is an important problem within artificial intelligence due to its…
Expand
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