Between SAT and UNSAT: The Fundamental Difference in CDCL SAT
Author:
- 27 October 2015
- book chapter
- Published by Springer Nature
- p. 307-323
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Refining Restarts Strategies for SAT and UNSAT2012
- On Freezing and Reactivating Learnt ClausesLecture Notes in Computer Science, 2011
- Adaptive Restart Strategies for Conflict Driven SAT Solvers2008
- A Lightweight Component Caching Scheme for Satisfiability Solvers2007
- An Extensible SAT-solver2004
- Chaff2001
- Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction ProblemsJournal of Automated Reasoning, 2000
- SAT versus UNSAT1996
- Optimal speedup of Las Vegas algorithmsInformation Processing Letters, 1993
- The intractability of resolutionTheoretical Computer Science, 1985