Institutional Repository
| local lemma: a new strategy of pruning in sat solvers | |
| Jia Xiangxue; Lu Runming; Liu Sheng; Zhang Jian | |
| 2010 | |
| Conference Name | 25th Annual ACM Symposium on Applied Computing, SAC 2010 |
| Source | Proceedings of the ACM Symposium on Applied Computing |
| Pages | 2071-2072 |
| Conference Date | March 22, |
| Conference Place | Sierre, Switzerland |
| Publish Place | United States |
| ISBN | 9781610000000 |
| Department | (1) State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, China; (2) Graduate University, Chinese Academy of Sciences, China |
| English Abstract | 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. |
| Sponsorship | ACM Special Interest Group on Applied Computing (SIGAPP); Hes.so; icare; CUSST |
| Content Type | 会议论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/8814 |
| Collection | 基础软件与系统重点实验室 |
| Recommended Citation 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. |
| Files in This Item: | ||||||
| File Name/Size | DocType | Version | Access | License | ||
| p2071-jia.pdf（250KB） | 开放获取 | -- | Application Full Text | |||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment