Get started
Keyword

Boolean satisfiability

Description: A computational problem in logic and computer science that asks whether some assignment of truth values makes a Boolean formula true.
Wikidata ID: wiki/Q875276
OpenAlex ID: keywords/boolean-satisfiability
Chaff
2001 · Matthew W. Moskewicz, Conor F. Madigan, et al. · Proceedings - ACM IEEE Design Automation Conference · 2,941
Analytic and Algorithmic Solution of Random Satisfiability Problems
2002 · M. Mézard, G. Parisi, et al. · Science · 1,072
Handbook of Satisfiability
2021 · Frontiers in artificial intelligence and applications · 1,039
Test pattern generation using Boolean satisfiability
1992 · T. Larrabee · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · 703
Efficient Conflict Driven Learning in a Boolean Satisfiability Solver
2001 · Lintao Zhang, Conor F. Madigan, et al. · 658
DNA computing on surfaces
2000 · Qinghua Liu, Liman Wang, et al. · Nature · 529
Handbook of Satisfiability
2021 · Armin Biere, Marijn J. H. Heule, et al. · 486
A simplified NP-complete satisfiability problem
1984 · Craig A. Tovey · Discrete Applied Mathematics · 382
PDF
Optimization using quantum mechanics: quantum annealing through adiabatic evolution
2006 · Giuseppe E Santoro, Erio Tosatti · Journal of Physics A Mathematical and General · 353
PDF
BerkMin: A fast and robust SAT-solver
2003 · E. Goldberg, Y. Novikov · Design, Automation, and Test in Europe · 334
Algorithms for Computing Minimal Unsatisfiable Subsets of Constraints
2007 · Mark H. Liffiton, Karem A. Sakallah · Journal of Automated Reasoning · 330
Modular verification of software components in C
2004 · S. Chaki, E.M. Clarke, et al. · IEEE Transactions on Software Engineering · 310
The Quest for Efficient Boolean Satisfiability Solvers
2002 · Lintao Zhang, Sharad Malik · Lecture notes in computer science · 286
PDF
Towards Understanding and Harnessing the Potential of Clause Learning
2004 · P. Beame, H. Kautz, et al. · Journal of Artificial Intelligence Research · 285
PDF
Chaff: engineering an efficient SAT solver
2002 · M.W. Moskewicz, C.F. Madigan, et al. · Proceedings - ACM IEEE Design Automation Conference · 279
Fault diagnosis and logic debugging using Boolean satisfiability
2005 · A. Smith, A. Veneris, et al. · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · 270
Leakage current reduction in CMOS VLSI circuits by input vector control
2004 · A. Abdollahi, F. Fallah, et al. · IEEE Transactions on Very Large Scale Integration (VLSI) Systems · 270
On Solving the Partial MAX-SAT Problem
2006 · Zhaohui Fu, Sharad Malik · Lecture notes in computer science · 263
PySAT: A Python Toolkit for Prototyping with SAT Oracles
2018 · Alexey Ignatiev, Antonio Morgado, et al. · Lecture notes in computer science · 261
Modeling and Verifying Systems Using a Logic of Counter Arithmetic with Lambda Expressions and Uninterpreted Functions
2002 · Randal E. Bryant, Shuvendu K. Lahiri, et al. · Lecture notes in computer science · 240
Conflict driven learning in a quantified Boolean Satisfiability solver
2002 · Lintao Zhang, Sharad Malik · Digest of technical papers/Digest of technical papers - IEEE/ACM International Conference on Computer-Aided Design · 234
MACACO: Modeling and analysis of circuits for approximate computing
2011 · Rangharajan Venkatesan, Amit Agarwal, et al. · 219
Recursive learning: a new implication technique for efficient solutions to CAD problems-test, verification, and optimization
1994 · W. Kunz, D.K. Pradhan · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · 214
Scalable error detection using boolean satisfiability
2005 · Yichen Xie, Alex Aiken · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · 213
Massively parallel probabilistic computing with sparse Ising machines
2022 · Navid Anjum Aadit, Andrea Grimaldi, et al. · Nature Electronics · 211
PDF
Works count: 4,060
Citation count: 47,730
Year
Topic
Type