Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
A Structure-preserving Clause Form Translation
Journal of Symbolic Computation
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Improvements to propositional satisfiability search algorithms
Improvements to propositional satisfiability search algorithms
FPGA '99 Proceedings of the 1999 ACM/SIGDA seventh international symposium on Field programmable gate arrays
A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
A machine program for theorem-proving
Communications of the ACM
Proceedings of the 38th annual Design Automation Conference
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
Finding bugs with a constraint solver
Proceedings of the 2000 ACM SIGSOFT international symposium on Software testing and analysis
Efficient conflict driven learning in a boolean satisfiability solver
Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
The Impact of Branching Heuristics in Propositional Satisfiability Algorithms
EPIA '99 Proceedings of the 9th Portuguese Conference on Artificial Intelligence: Progress in Artificial Intelligence
Symbolic Model Checking without BDDs
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
SATO: An Efficient Propositional Prover
CADE-14 Proceedings of the 14th International Conference on Automated Deduction
Integrating Equivalency Reasoning into Davis-Putnam Procedure
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Eighteenth national conference on Artificial intelligence
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Conflict Analysis in Search Algorithms for Satisfiability
ICTAI '96 Proceedings of the 8th International Conference on Tools with Artificial Intelligence
Proceedings of the conference on Design, automation and test in Europe
BerkMin: A Fast and Robust Sat-Solver
Proceedings of the conference on Design, automation and test in Europe
Searching for truth: techniques for satisfiability of boolean formulas
Searching for truth: techniques for satisfiability of boolean formulas
Experimental results on the crossover point in satisfiability problems
AAAI'93 Proceedings of the eleventh national conference on Artificial intelligence
Using CSP look-back techniques to solve real-world SAT instances
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Combinational test generation using satisfiability
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Accurate timing analysis using SAT and pattern-dependent delay models
Proceedings of the conference on Design, automation and test in Europe
On Composite Leakage Current Maximization
Journal of Electronic Testing: Theory and Applications
Finding Minimal Unsatisfiable Cores of Declarative Specifications
FM '08 Proceedings of the 15th international symposium on Formal Methods
Declarative Infrastructure Configuration Synthesis and Debugging
Journal of Network and Systems Management
Present and Future of Practical SAT Solving
Complexity of Constraints
Integrated verification approach during ADL-driven processor design
Microelectronics Journal
Automatic Model Generation Strategies for Model Transformation Testing
ICMT '09 Proceedings of the 2nd International Conference on Theory and Practice of Model Transformations
Width-Based Restart Policies for Clause-Learning Satisfiability Solvers
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Topological configurations (n4) exist for all n≥17
European Journal of Combinatorics
SATzilla: portfolio-based algorithm selection for SAT
Journal of Artificial Intelligence Research
Critical Path Selection for Delay Testing Considering Coupling Noise
Journal of Electronic Testing: Theory and Applications
Sat-solving approaches to context-aware enterprise network security management
IEEE Journal on Selected Areas in Communications - Special issue on network infrastructure configuration
Compacting test vector sets via strategic use of implications
Proceedings of the 2009 International Conference on Computer-Aided Design
Formal Verification of Security Policy Implementations in Enterprise Networks
ICISS '09 Proceedings of the 5th International Conference on Information Systems Security
Kodkod: a relational model finder
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
SATzilla-07: the design and analysis of an algorithm portfolio for SAT
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Computation of satisfiability degree based on CNF
FSKD'09 Proceedings of the 6th international conference on Fuzzy systems and knowledge discovery - Volume 6
A cost effective approach for online error detection using invariant relationships
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
A mobile IP based WLAN security management framework with reconfigurable hardware acceleration
Proceedings of the 3rd international conference on Security of information and networks
Detecting errors using multi-cycle invariance information
Proceedings of the Conference on Design, Automation and Test in Europe
On the power of clause-learning SAT solvers as resolution engines
Artificial Intelligence
Finding solutions in goal models: an interactive backward reasoning approach
ER'10 Proceedings of the 29th international conference on Conceptual modeling
Dynamic deployment of context-aware access control policies for constrained security devices
Journal of Systems and Software
Test Vector Generation for Post-Silicon Delay Testing Using SAT-Based Decision Problems
Journal of Electronic Testing: Theory and Applications
Distilling critical attack graph surface iteratively through minimum-cost SAT solving
Proceedings of the 27th Annual Computer Security Applications Conference
Generation of oriented matroids using satisfiability solvers
ICMS'06 Proceedings of the Second international conference on Mathematical Software
A clause-based heuristic for SAT solvers
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
A scalable algorithm for minimal unsatisfiable core extraction
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
A hardware relaxation paradigm for solving NP-hard problems
VoCS'08 Proceedings of the 2008 international conference on Visions of Computer Science: BCS International Academic Conference
Using models of partial knowledge to test model transformations
ICMT'12 Proceedings of the 5th international conference on Theory and Practice of Model Transformations
Pairwise testing for software product lines: comparison of two approaches
Software Quality Control
Using implications to choose tests through suspect fault identification
ACM Transactions on Design Automation of Electronic Systems (TODAES) - Special section on adaptive power management for energy and temperature-aware computing systems
A multilevel memetic algorithm for large sat-encoded problems
Evolutionary Computation
NADEEF: a commodity data cleaning system
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Algorithm runtime prediction: Methods & evaluation
Artificial Intelligence
| Hi-index | 0.00 |
The Boolean Satisfiability Problem (SAT) is a well known NP-Complete problem. While its complexity remains a source of many interesting questions for theoretical computer scientists, the problem has found many practical applications in recent years. The emergence of efficient SAT solvers which can handle large structured SAT instances has enabled the use of SAT solvers in diverse domains such as electronic design automation and artificial intelligence. These applications continue to motivate the development of faster and more robust SAT solvers. In this paper, we describe the popular SAT solver zchaff with a focus on recent developments.