Strong Conflict Analysis for Propositional Satisfiability

DATE(2006)

引用 23|浏览15
暂无评分
摘要
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
更多
查看译文
关键词
standard conflict clause,state-of-the-art solvers,supplemental clause,computability,unique implication point,conflict analysis,david-putnam-logemann-loveland procedure,clause recording,strong conflict analysis,propositional satisfiability solvers,implication graph,new approach,new technique work,repeated conflict,propositional satisfiability,computer science,stochastic processes,algorithm design and analysis
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要