100 likes | 183 Views
Clause Deletion Strategy in a Satisfiability Solver. Presented by Colin Southwood For CMPS 217, Logic in Computer Science Tuesday, December 11 th , 2007. Conflict, or ‘Learnt’ Clauses.
E N D
Clause Deletion Strategy in a Satisfiability Solver Presented by Colin Southwood For CMPS 217, Logic in Computer Science Tuesday, December 11th, 2007
Conflict, or ‘Learnt’ Clauses • 1996 GRASP– “Generic seaRch Algorithm for the Satisfiability Problem” by Joao P. Marques Silva and Karem A. Sakallah • Introduced the idea of recording the causes of conflicts • Prunes the Search Tree
Problems with accumulating Conflict Clauses • Takes up Space, makes using the lessons depend on the access times of main memory and possibly of disk • Requires BCP take more time, when it already takes up a lot of time ( BCP already takes %90 of time for solving SAT problems )
learnts more easily sat. criteria Of deletion; Num. learnts rarely exceeds limit
How to deal with knowing too much Delete no clauses? Delete “weaker” clauses? Delete “low activity” clauses? No. Yes. Yes. In the right balance. It is a balancing act. Don’t delete too many, don’t delete too few!