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 |
| 会议日期 | March 22, |
| 会议地点 | Sierre, Switzerland |
| 页码 | 2071-2072 |
| 英文摘要 | 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 |
| 会议录 | Proceedings of the ACM Symposium on Applied Computing
 |
| 会议录出版地 | United States |
| ISBN号 | 9781610000000 |
| 源URL | [http://124.16.136.157/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]. 见:25th Annual ACM Symposium on Applied Computing, SAC 2010. Sierre, Switzerland. March 22,. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。