Title :
Strong Conflict Analysis for Propositional Satisfiability
Author :
Jin, HoonSang ; Somenzi, Fabio
Abstract :
We present a new approach to conflict analysis for propositional satisfiability solvers based on the DPLL procedure and clause recording. When conditions warrant it, we generate a supplemental clause from a conflict. This clause does not contain a unique implication point, and therefore cannot replace the standard conflict clause. However, it is very effective at reducing excessive depth in the implication graphs and at preventing repeated conflicts on the same clause. Experimental results show consistent improvements over state-of-the-art solvers and confirm our analysis of why the new technique works
Keywords :
computability; David-Putnam-Logemann-Loveland procedure; clause recording; conflict analysis; propositional satisfiability solvers; standard conflict clause; Algorithm design and analysis; Business continuity; Computer aided engineering; Computer science; Contracts; Electronic design automation and methodology; Large scale integration; Stochastic processes;
Conference_Titel :
Design, Automation and Test in Europe, 2006. DATE '06. Proceedings
Conference_Location :
Munich
Print_ISBN :
3-9810801-1-4
DOI :
10.1109/DATE.2006.244149