greedy clique decomposition for symbolic satisfiability solving

CORC > 软件研究所 > 软件所图书馆 > 期刊论文

	greedy clique decomposition for symbolic satisfiability solving
	Xu Yanyan ; Chen Wei ; Su Kaile ; Zhang Wenhui
刊名	International Journal of Advancements in Computing Technology
	2012
卷号	4 期号:10 页码:174-184
关键词	Heuristic methods
ISSN号	2005-8039
中文摘要	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.
英文摘要	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.
收录类别	EI
语种	英语
公开日期	2013-09-17
内容类型	期刊论文
源URL	[http://ir.iscas.ac.cn/handle/311060/15450]
专题	软件研究所_软件所图书馆_期刊论文
推荐引用方式 GB/T 7714	Xu Yanyan,Chen Wei,Su Kaile,et al. greedy clique decomposition for symbolic satisfiability solving[J]. International Journal of Advancements in Computing Technology,2012,4(10):174-184.
APA	Xu Yanyan,Chen Wei,Su Kaile,&Zhang Wenhui.(2012).greedy clique decomposition for symbolic satisfiability solving.International Journal of Advancements in Computing Technology,4(10),174-184.
MLA	Xu Yanyan,et al."greedy clique decomposition for symbolic satisfiability solving".International Journal of Advancements in Computing Technology 4.10(2012):174-184.