Search-based SAT using zero-suppressed BDDs (original) (raw)
Related papers
2005
SBSAT: a State-Based, BDD-Based Satisfiability Solver
2003
SAT Based BDD Solver for Quantified Boolean Formulas
2004
A compressed breadth-first search for satisfiability
2002
A Variable Dependency-Based Decision Strategy for Boolean Satisfiability Problems
A new look at bdds for pseudo-boolean constraints
Enric Rodríguez-carbonell, Robert Nieuwenhuis
A Hardware/Software Approach to Accelerate Boolean Satisfiability
Workshop on Design and Diagnostics of Electronic Circuits and Systems, 2000
Efficient data structures for backtrack search SAT solvers
Annals of Mathematics and Artificial Intelligence, 2005
PBS: a backtrack-search pseudo-boolean solver and optimizer
Proceedings of the 5th …, 2002
Exploiting Target Enlargement and Dynamic Abstraction within Mixed BDD and SAT Invariant Checking
2004
Chaff: Engineering An Efficient SAT Solver
Design Automation …, 2001
Faster SAT and smaller BDDs via common function structure
International Conference on Computer Aided Design, 2001
An Overview of Backtrack Search Satisfiability Algorithms
Annals of Mathematics and Artificial Intelligence, 2003
Indexed BDDs: algorithmic advances in techniques to represent and verify Boolean functions
IEEE Transactions on Computers, 1997
Boolean Equi-propagation for Optimized SAT Encoding
Lecture Notes in Computer Science, 2011
BDDs for Pseudo-Boolean Constraints – Revisited
Robert Nieuwenhuis, Enric Rodríguez-carbonell
Lecture Notes in Computer Science, 2011
Generalizing Boolean Satisfiability III: Implementation
Journal of Artificial Intelligence Research
Encoding PB Constraints into SAT via Binary Adders and BDDs -- Revisited
EasyChair preprint, 2018
Boolean equi-propagation for concise and efficient SAT encodings of combinatorial problems
A Symbolic Search Based Approach for Quantified Boolean Formulas
Lecture Notes in Computer Science, 2005
Solving the satisfiability problem through Boolean networks
AI* IA 99: Advances in Artificial Intelligence, 2000
Heuristic-Based Backtracking Relaxation for Propositional Satisfiability
Journal of Automated Reasoning, 2006
On Unordered BDDs and Quantified Boolean Formulas
Progress in Artificial Intelligence, 2019
Improving CNF representations in SAT-based ATPG for industrial circuits using BDDs
2010 15th IEEE European Test Symposium, 2010
Heuristic backtracking algorithms for SAT
Proceedings. 4th International Workshop on Microprocessor Test and Verification - Common Challenges and Solutions, 2003
Heuristic-Based Backtracking for Propositional Satisfiability
Lecture Notes in Computer Science, 2003
Memory Efficient All-Solutions SAT Solver and Its Application for Reachability Analysis
Lecture Notes in Computer Science, 2004
Hybrid BDD and All-SAT Method for Model Checking
Lecture Notes in Computer Science, 2009
MINCE: A Static Global Variable-Ordering Heuristic for SAT Search and BDD Manipulation
J. Univers. Comput. Sci., 2004
Lecture Notes in Computer Science
Function-Complete Lookahead in Support of Efficient SAT Search Heuristics
Journal of Universal Computer Science, 2004
Improving SAT-based bounded model checking by means of BDD-based approximate traversals
2003 Design, Automation and Test in Europe Conference and Exhibition, 2003
2014
A reconfigurable, pipelined, conflict directed jumping search SAT solver
2011 Design, Automation & Test in Europe, 2011