local lemma: a new strategy of pruning in sat solvers

	local lemma: a new strategy of pruning in sat solvers
	Jia Xiangxue; Lu Runming; Liu Sheng; Zhang Jian
	2010
会议名称	25th Annual ACM Symposium on Applied Computing, SAC 2010
会议录名称	Proceedings of the ACM Symposium on Applied Computing
页码	2071-2072
会议日期	March 22,
会议地点	Sierre, Switzerland
出版地	United States
ISBN	9781610000000
部门归属	(1) State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, China; (2) Graduate University, Chinese Academy of Sciences, China
摘要	This paper proposes a search tree pruning strategy for SAT solving. It is called Local Lemma, because it generates lemmas from explored subtrees and these lemmas are valid only in a part of the search tree. The paper explains the basic principle of the strategy, illustrates it with an example, and presents some experimental results. © 2010 ACM.
主办者	ACM Special Interest Group on Applied Computing (SIGAPP); Hes.so; icare; CUSST
内容类型	会议论文
URI标识	http://ir.iscas.ac.cn/handle/311060/8814
专题	基础软件与系统重点实验室
推荐引用方式 GB/T 7714	Jia Xiangxue,Lu Runming,Liu Sheng,et al. local lemma: a new strategy of pruning in sat solvers[C]. United States,2010:2071-2072.