GRASP—a new search algorithm for satisfiability
Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design
Efficient conflict driven learning in a boolean satisfiability solver
Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
Counting Models Using Connected Components
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
FORCE: a fast and easy-to-implement variable-ordering heuristic
Proceedings of the 13th ACM Great Lakes symposium on VLSI
Journal of Artificial Intelligence Research
A structure-based variable ordering heuristic for SAT
IJCAI'03 Proceedings of the 18th international joint 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
Heuristics for fast exact model counting
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Variable ordering for efficient SAT search by analyzing constraint-variable dependencies
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
SAT graph-based representation: A new perspective
Journal of Algorithms
Formalization and Implementation of Modern SAT Solvers
Journal of Automated Reasoning
A refinement-based compositional reasoning framework for pipelined machine verification
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Solution Enumeration for Projected Boolean Search Problems
CPAIOR '09 Proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Finding Lean Induced Cycles in Binary Hypercubes
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Backdoors in the Context of Learning
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Instance-Based Selection of Policies for SAT Solvers
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Width-Based Restart Policies for Clause-Learning Satisfiability Solvers
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Problem-Sensitive Restart Heuristics for the DPLL Procedure
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
The Conflict-Driven Answer Set Solver clasp: Progress Report
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Efficient SAT solving for non-clausal formulas using DPLL, graphs, and watched cuts
Proceedings of the 46th Annual Design Automation Conference
SAT-Solving in Practice, with a Tutorial Example from Supervisory Control
Discrete Event Dynamic Systems
Predicting learnt clauses quality in modern SAT solvers
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
On Modern Clause-Learning Satisfiability Solvers
Journal of Automated Reasoning
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Artificial Intelligence
Solver technology for system-level to RTL equivalence checking
Proceedings of the Conference on Design, Automation and Test in Europe
Heuristics for planning with SAT
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
A method for debugging of pipelined processors in formal verification by correspondence checking
Proceedings of the 2010 Asia and South Pacific Design Automation Conference
Boosting local search thanks to CDCL
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Improving resource-unaware SAT solvers
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Method for formal verification of soft-error tolerance mechanisms in pipelined microprocessors
ICFEM'10 Proceedings of the 12th international conference on Formal engineering methods and software engineering
An expressive and efficient solution to the service selection problem
ISWC'10 Proceedings of the 9th international semantic web conference on The semantic web - Volume Part I
Potassco: The Potsdam Answer Set Solving Collection
AI Communications - Answer Set Programming
SAT-based semiformal verification of hardware
Proceedings of the 2010 Conference on Formal Methods in Computer-Aided Design
Challenges in answer set solving
Logic programming, knowledge representation, and nonmonotonic reasoning
On freezing and reactivating learnt clauses
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Between restarts and backjumps
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Generating diverse solutions in SAT
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Empirical study of the anatomy of modern sat solvers
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
ICFEM'11 Proceedings of the 13th international conference on Formal methods and software engineering
SAT solving with reference points
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Integrating dependency schemes in search-based QBF solvers
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Exploiting circuit representations in QBF solving
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Conflict-driven answer set solving: From theory to practice
Artificial Intelligence
An overview of parallel SAT solving
Constraints
Off the trail: re-examining the CDCL algorithm
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Revisiting clause exchange in parallel SAT solving
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Intensification search in modern SAT solvers
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Planning as satisfiability: Heuristics
Artificial Intelligence
Refining restarts strategies for SAT and UNSAT
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Counter implication restart for parallel SAT solvers
LION'12 Proceedings of the 6th international conference on Learning and Intelligent Optimization
Using cross-entropy for satisfiability
Proceedings of the 28th Annual ACM Symposium on Applied Computing
Concurrent clause strengthening
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
On the interpolation between product-based message passing heuristics for SAT
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Improving glucose for incremental SAT solving with assumptions: application to MUS extraction
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Just-in-time compilation of knowledge bases
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
FPGA acceleration of enhanced boolean constraint propagation for SAT solvers
Proceedings of the International Conference on Computer-Aided Design
| Hi-index | 0.00 |
We introduce in this paper a lightweight technique for reducing work repetition caused by non-chronological backtracking commonly practiced by DPLL-based SAT solvers. The presented technique can be viewed as a partial component caching scheme. Empirical evaluation of the technique reveals significant improvements on a broad range of industrial instances.