solving difficult sat problems by using obdds and greedy clique decomposition
文献类型：会议论文
| 作者 | Xu Yanyan ; Chen Wei ; Su Kaile ; Zhang Wenhui |
| 出版日期 | 2012 |
| 会议名称 | 6th International Frontiers of Algorithmics Workshop, FAW 2012 and 8th International Conference on Algorithmic Aspects of Information and Management, AAIM 2012 |
| 会议日期 | May 14, 2012 - May 16, 2012 |
| 会议地点 | Beijing, China |
| 关键词 | Algorithms Heuristic methods |
| 页码 | 259-268 |
| 中文摘要 | In this paper, we propose an OBDD-based algorithm called greedy clique decomposition, which is a new variable grouping heuristic method, to solve difficult SAT problems. We implement our algorithm and compare it with several state-of-art SAT solvers including Minisat, Ebddres and TTS. We show that with this new heuristic method, our implementation of an OBDD-based satisfiability solver can perform better for selected difficult SAT problems, whose conflict graphs possess a clique-like structure. © 2012 Springer-Verlag. |
| 英文摘要 | In this paper, we propose an OBDD-based algorithm called greedy clique decomposition, which is a new variable grouping heuristic method, to solve difficult SAT problems. We implement our algorithm and compare it with several state-of-art SAT solvers including Minisat, Ebddres and TTS. We show that with this new heuristic method, our implementation of an OBDD-based satisfiability solver can perform better for selected difficult SAT problems, whose conflict graphs possess a clique-like structure. © 2012 Springer-Verlag. |
| 收录类别 | EI |
| 会议录 | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
 |
| 语种 | 英语 |
| ISSN号 | 0302-9743 |
| ISBN号 | 9783642296994 |
| 源URL | [http://ir.iscas.ac.cn/handle/311060/15692]  |
| 专题 | 软件研究所_软件所图书馆_会议论文 |
| 推荐引用方式 GB/T 7714 | Xu Yanyan,Chen Wei,Su Kaile,et al. solving difficult sat problems by using obdds and greedy clique decomposition[C]. 见:6th International Frontiers of Algorithmics Workshop, FAW 2012 and 8th International Conference on Algorithmic Aspects of Information and Management, AAIM 2012. Beijing, China. May 14, 2012 - May 16, 2012. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。