| 题名: | local lemma: a new strategy of pruning in sat solvers |
| 作者: | Jia Xiangxue
; Lu Runming
; Liu Sheng
; Zhang Jian
|
| 会议文集: | Proceedings of the ACM Symposium on Applied Computing
|
| 会议名称: | 25th Annual ACM Symposium on Applied Computing, SAC 2010
|
| 会议日期: | March 22,
|
| 出版日期: | 2010
|
| 会议地点: | 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
|
| 主办者: | ACM Special Interest Group on Applied Computing (SIGAPP); Hes.so; icare; CUSST
|
| 英文摘要: | 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. |
| 内容类型: | 会议论文
|
| URI标识: | http://ir.iscas.ac.cn/handle/311060/8814
|
| Appears in Collections: | 计算机科学国家重点实验室 _会议论文
|
| File Name/ File Size |
Content Type |
Version |
Access |
License |
|
|---|
| p2071-jia.pdf（250KB） | -- | -- | 限制开放 | -- | 联系获取全文 |
|
| Recommended Citation: | |
Jia Xiangxue,Lu Runming,Liu Sheng,et al. local lemma: a new strategy of pruning in sat solvers[C]. 见:25th Annual ACM Symposium on Applied Computing, SAC 2010. Sierre, Switzerland. March 22,.
|
|
|
