Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 241,130,308 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.
2013
2013
Visual Landmark Selection for Mobile Robot Navigation
A. Gorbenko
,
V. Popov
2013
Corpus ID: 14495210
A large number of landmarks selection techniques has been proposed. However, finding optimal solutions requires to solve some…
Expand
2009
2009
Understanding and improving a modern SAT solver
Alexander Nadel
2009
Corpus ID: 124746072
Propositional satisfiability (SAT) is an NP-complete problem, holding a central place in computer science and engineering. SAT…
Expand
2009
2009
A Collaborative Approach for Multi-Threaded SAT Solving
Pascal Vander-Swalmen
,
Gilles Dequen
,
M. Krajecki
International journal of parallel programming
2009
Corpus ID: 44982341
The last decade progresses have led the Satisfiability Problem (sat) to be a great and competitive practical approach to solve a…
Expand
2007
2007
Routing in Optical and Non-Optical Networks using Boolean Satisfiability
F. Aloul
,
Bashar Al-Rawi
,
M. Aboelaze
Journal of Communications
2007
Corpus ID: 9029052
Today, most routing problems are solved using Dijkstra’s shortest path algorithm. Many efficient implementations of Dijkstra’s…
Expand
2007
2007
Solving the Satisfiability Problem Using Finite Learning Automata
Ole-Christoffer Granmo
,
N. Bouhmala
International Journal of Computer Science and…
2007
Corpus ID: 17917274
A large number of problems that occur in knowledge -representation, learning, VLSI-design, and other areas of artificial…
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
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
2001
2001
A Genetic Algorithm for Satisfiability Problem in a Probabilistic Logic: A First Report
Z. Ognjanović
,
Jozef J. Kratica
,
M. Milovanović
European Conference on Symbolic and Quantitative…
2001
Corpus ID: 38513757
This paper introduces a genetic algorithm for satisfiability problem in a probabilistic logic. A local search based improvement…
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
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