Lazy Clause Exchange Policy for Parallel SAT Solvers
Authors:
- 1 January 2014
- book chapter
- Published by Springer Nature
- p. 197-205
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- An Effective Distributed D&C Approach for the Satisfiability Problem2014
- Inprocessing Rules2012
- Revisiting Clause Exchange in Parallel SAT Solving2012
- Cube and Conquer: Guiding CDCL SAT Solvers by Lookaheads2012
- On Freezing and Reactivating Learnt ClausesLecture Notes in Computer Science, 2011
- Partitioning SAT Instances for Distributed SolvingLecture Notes in Computer Science, 2010
- Diversification and Intensification in Parallel SAT Solving2010
- SAT in Bioinformatics: Making the Case with Haplotype Inference2006
- Chaff2001
- Symbolic Model Checking without BDDs1999