中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR  > 软件所图书馆  > 期刊论文
Title:
greedy clique decomposition for symbolic satisfiability solving
Author: Xu Yanyan ; Chen Wei ; Su Kaile ; Zhang Wenhui
Keyword: Heuristic methods
Source: International Journal of Advancements in Computing Technology
Issued Date: 2012
Volume: 4, Issue:10, Pages:174-184
Indexed Type: EI
Department: (1) School of Information Science and Technology Beijing Forestry University China; (2) Naveen Jindal School of Management The University of Texas at Dallas United States; (3) College of Mathematics Physics and Information Engineering Zhejiang Normal University Jinhua China; (4) State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences China
Abstract: Motivated by the recent theoretical results regarding OBDD proof system, this paper applies a new variable grouping heuristic called greedy clique decomposition to symbolic satisfiability solving. Experimental results are compared against other state-of-the-art satisfiability solving tools, including Ebddres, Minisat, TTS and SSAT. We are able to show that with this new heuristic method, our implementation of an OBDD based satisfiability solver can perform better for certain instances, where conflict graphs possess a clique-like structure.
English Abstract: Motivated by the recent theoretical results regarding OBDD proof system, this paper applies a new variable grouping heuristic called greedy clique decomposition to symbolic satisfiability solving. Experimental results are compared against other state-of-the-art satisfiability solving tools, including Ebddres, Minisat, TTS and SSAT. We are able to show that with this new heuristic method, our implementation of an OBDD based satisfiability solver can perform better for certain instances, where conflict graphs possess a clique-like structure.
Language: 英语
Content Type: 期刊论文
URI: http://ir.iscas.ac.cn/handle/311060/15450
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. greedy clique decomposition for symbolic satisfiability solving[J]. International Journal of Advancements in Computing Technology,2012-01-01,4(10):174-184.
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