On Proof Systems Behind Efficient SAT Solvers高效的坐在解算器背后的证明系统.pptVIP

下载本文档

2
0
约1.26万字
约 38页
2017-03-08 发布于上海
举报
版权申诉

On Proof Systems Behind Efficient SAT Solvers高效的坐在解算器背后的证明系统.ppt

1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

On Proof Systems Behind Efficient SAT Solvers高效的坐在解算器背后的证明系统

On Proof Systems Behind Efficient SAT Solvers DoRon B. Motter and Igor L. Markov University of Michigan, Ann Arbor Motivation Best complete SAT solvers are based on DLL Runtime (on unSAT instances) is lower-boundedby the length of resolution proofs Exponential lower bounds for pigeonholes Previous work: we introduced the Compressed Breadth-First Search algorithm (CBFS/Cassatt) Empirical measurements: our implementationof Cassatt spends Θ(n4) time on PHPnn+1 This work: we show analytically that CBFS refutes pigeonhole instances PHPnn+1 in poly time Hope to find a proof system behind Cassatt Empirical Performance Related Work We are pursuing novel algorithms for SAT facilitated by data structures with compression Zero-suppressed Binary Decision Diagrams (ZDDs) Existing algorithms can be implemented w ZDDs The DP procedure: Simon and Chatalic, [ICTAI 2000] DLL: Aloul, Mneimneh and Sakallah, [DATE 2002] We use the union-with-subsumption operation Details of the Cassatt algorithm are in Motter and Markov, [ALENEX 2002] Outline Background Compressed BFS Overview Example Algorithm Pigeonhole Instances Outline of Proof Some bounds Conclusions and Ongoing Work Background Background: Terminology Given partial truth assignment Classify all clauses into: Satisfied At least one literal assigned true Violated All literals assigned, and not satisfied Open 1+ literal assigned, and no literals assigned true Open clauses are activated but not satisfied Activated Have at least one literal assigned some value Unit Have all but one literal assigned, and are open A valid partial truth assignment ? no violated clauses Open Clauses Straightforward Breadth-First Search Maintain all valid partial truth assignmentsof a given depth; increase depth in steps Valid partial truth assignments? sets of open clauses No literals assigned ? Clause is not activated All literals assigned ? Clause must be satisfied Because: assignment is valid ? no clauses are violated “Cut” clause = some, b