期刊文献+

一种新的SAT问题预处理算法 被引量:2

A New Algorithm for SAT Preprocessing
下载PDF
导出
摘要 提出了一项新的正向推理技术:对称扩展的一元子句推导(Symmetric Extended Unit Propagation)。与传统的一元子句推导技术相比,文中的方法通过在一元子句推导过程中添加对称的蕴涵关系从而能够推导出更多的一元子句。基于这项新技术实现了一个可满足性问题(SAT)预处理器Snowball。实验结果验证了该项技术的有效性,表明该预处理器Snowball能够有效地化简SAT问题的规模并减少解决SAT问题的时间。 In this paper we propose a new forward reasoning technique called Symmetric Extended Unit Propagation (SEUP). Compared to the ordinary UP our method can deduce more unit literals through adding the symmetric implications during unit propagating literals. A SAT preprocessor Snowball is implemented based on this new technique. Experimental results verify the efficiency of this new technique and show that Snowball can generously reduce the overall runtime in solving SAT problems.
作者 熊伟 唐璞山
出处 《微电子学与计算机》 CSCD 北大核心 2007年第10期193-196,共4页 Microelectronics & Computer
基金 国家自然科学基金项目(90207002)
关键词 可满足性问题 一元子句推导 蕴涵图 satisfiability(SAT) unit propagation implication graph
  • 相关文献

参考文献7

  • 1刘歆.SAT数据结构与组合测试生成[J].微电子学与计算机,2003,20(5):39-44. 被引量:5
  • 2Simon L,Le Berre D,Hirsch E.The sat2002 competition[J].Accepted for publication in Annals of Mathematics and Artificial Intelligence(AMAI),2005,43:343-378
  • 3Brafman R I.A simplifier for propositional formulas with many binary clauses[C].In:Proceedings of the Intemational Joint Conference on Artifical Intelligence(IJCAI),2001:515-522
  • 4Subbarayan S,Pradha D.NiVER:non increasins variable elimination resolution for preproeessing SAT instances[C].In Prel.Proc.SAT,2004
  • 5Bachhus F,Winter J.Effective preprocessing with hyperresolution and equality reduction[C].SAT,2003:341-355
  • 6Davis M,Putnam H.A computing procedure for quantification theory[C].J.of the ACM.1960
  • 7Li Chu-min.Integrating equivalency reasoning into davisputnam procedure.In Proceedings of AAAI,Austin,Texas,USA,July 2000:291-296

二级参考文献14

  • 1B.Selman, H.Kautz and B.Cohen. Local search strategies for satisfiability testing, DIMACS Series in Discrete Mathmatics and Theoretical Computer Science,AMS, 1996.Vol.26.
  • 2dO.Coudert. On solving covering problems. In Proc. es- ign Automation Conf., Jun.1996:197-202.
  • 3B.Selman and H.Kautz. Domain independent extensionsto GSAT: Solving large structured satisfiability problems. In. Proc. of the Int'l Joint Conf. on Artificial Intelligence, 1993:290-295.
  • 4R.M.StaUman and G.J.Sussman. Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis. Artificial Intelligence,1977, 9:135-196.
  • 5M.Yokoo. Weak-commitment search for solving satisfaction problems. In Proc. of the National Conf. on Artificial Intelligence, 1994:313-318.
  • 6L.Baptista and J.P.Marques-Silva. Using randomization and learning to solve hard real-world instances of satisfiability, In Int'l Conf. on Constraint Programming, Sept. 2000:489-494.
  • 7T.Larrabee. Test Pattern Generation Using Boolean Satisfiability, IEEE Trans. on Computer Aided Design of Integrated Circuits and Systems, 1992, 1: 4-15.
  • 8P.Stephan, R.K.Brayton, and A.Sangiovanni-Vincenteli.Combinational Test Generation Using Satisfiability,IEEE Trans. on Computer Aided Design of Integrated Circuits and Systems, 1996.9: 1167-1176.
  • 9M.Schulz and E.Auth. Improved deterministic test pattern generation with applications to redundancy identification, IEEE Trans. on Computer Aided Design of Integrated Circuits and Systems, 1989.7, 811-816.
  • 10A.Rauzy. Polynomial restrictions of SAT: What can be done with an efficient implementation of the Davis and Putnam's procedure? Proc. of the first Int'l Conf. on Principles and Practice of Constraint Programming,1995:515-532.

共引文献4

同被引文献10

引证文献2

二级引证文献9

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部