An Improved All-solution SAT Solver

摘要：

All-soluticn Boolean satisfiability (SAT) solver is used to find the optimized solution,which is implemented by iteratively calling a general SAT solver. Converting the observability of variables to clauses has been proved a good approach of exploiting circuit observability to improve the performance of SAT solver. But the original method cant take full use of this property because of total ordering. In this paper,an improved approach without total ordering restriction on variables is proposed. Additionally,a new all-solution solver based on this approach is implemented. The experimental results show the improved approach is very efficient for all-solution SAT problem.

作者: Xiuqin Wang Guangsheng Ma Hao Wang

作者单位: Computer Science and Technology Institute,Harbin Engineering University,Harbin 150001,P.R.China Department of Computer and Information Engineering,Heilongjiang Institute of Science and Technology,

会议类型: 国际会议

会议名称: 9th International Conference on Solid-State and Integrated-Circuit Technology(第9届固态和集成电路国际会议)

会议地点: 北京

会议语种:英文

页码: 2260-2263

在线出版日期: 2008-10-20（万方平台首次上网日期，不代表论文的发表时间）