中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR  > 软件所图书馆  > 会议论文
Title:
solving difficult sat problems by using obdds and greedy clique decomposition
Author: Xu Yanyan ; Chen Wei ; Su Kaile ; Zhang Wenhui
Source: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Conference Name: 6th International Frontiers of Algorithmics Workshop, FAW 2012 and 8th International Conference on Algorithmic Aspects of Information and Management, AAIM 2012
Conference Date: May 14, 2012 - May 16, 2012
Issued Date: 2012
Conference Place: Beijing, China
Keyword: Algorithms ; Heuristic methods
Indexed Type: EI
ISSN: 0302-9743
ISBN: 9783642296994
Department: (1) School of Information Science and Technology Beijing Forestry University China; (2) Naveen Jindal School of Management University of Texas Dallas TX United States; (3) College of Mathematics Physics and Information Engineering Zhejiang Normal University Jinhua China; (4) School of Electronics Engineering and Computer Science Peking University China; (5) State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences China
Abstract: 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.
English Abstract: 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.
Language: 英语
Content Type: 会议论文
URI: http://ir.iscas.ac.cn/handle/311060/15692
Appears in Collections:软件所图书馆_会议论文

Files in This Item:

There are no files associated with this item.


Recommended Citation:
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.
Service
Recommend this item
Sava as my favorate item
Show this item's statistics
Export Endnote File
Google Scholar
Similar articles in Google Scholar
[Xu Yanyan]'s Articles
[Chen Wei]'s Articles
[Su Kaile]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[Xu Yanyan]‘s Articles
[Chen Wei]‘s Articles
[Su Kaile]‘s Articles
Related Copyright Policies
Null
Social Bookmarking
Add to CiteULike Add to Connotea Add to Del.icio.us Add to Digg Add to Reddit
所有评论 (0)
暂无评论
 
评注功能仅针对注册用户开放,请您登录
您对该条目有什么异议,请填写以下表单,管理员会尽快联系您。
内 容:
Email:  *
单位:
验证码:   刷新
您在IR的使用过程中有什么好的想法或者建议可以反馈给我们。
标 题:
 *
内 容:
Email:  *
验证码:   刷新

Items in IR are protected by copyright, with all rights reserved, unless otherwise indicated.

 

 

Valid XHTML 1.0!
Copyright © 2007-2019  中国科学院软件研究所 - Feedback
Powered by CSpace