Evolving Local Search Heuristics for SAT Using Genetic利用遗传算法进化的局部搜索启发式算法.pptVIP

下载本文档

6
0
约 28页
2017-02-14 发布于上海
举报
版权申诉

Evolving Local Search Heuristics for SAT Using Genetic利用遗传算法进化的局部搜索启发式算法.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文档。上传文档

Evolving Local Search Heuristics for SAT Using Genetic Programming Alex Fukunaga Computer Science Department University of California, Los Angeles Outline Satisfiability testing Local search for SAT CLASS: A GP system for discovering SAT local search heuristics Empirical evaluation of CLASS Propositional Satisfiability (SAT) Given: Set of boolean variables A well formed formula using the variables Problem: Is there some assignment of truth values (true, false) to the variables such that the formula evaluates to true? Examples: 1) (a or b or ~c) and (~a or c) and (~a or ~b or c) Satisfiable (let a=true, b=false, c=true) 2) (a or b or c) and (~a or ~b) and (~b or ~c) and (~a or ~c) Unsatisfiable. SAT NP-complete First problem to be proven NP-complete (Cook, 1973) Numerous applications Circuit verification Scheduling AI Planning Theorem proving Very active research area Recent applications in VLSI CAD Annual SAT conference Local Search for SAT Local search is very successful at solving hard, satisfiable SAT instances. Many local search algorithm variants for SAT proposed since the discovery of GSAT [Selman, Mitchell, Levesque 1992]. Generic SAT local search framework: T: = randomly generated truth assignment For j:= 1 to cutoff If T satisfies formula then return T V:= Choose a variable using some variable selection heuristic T’ := T with value of V reversed Return failure (no satisfying assignment found). Definitions Positive/Negative/Net Gain Given candidate variable assignment T for CNF formula F, let B0 be the total # of clauses that are currently unsatisfied in F. Let T’ be the state of F if variable V is flipped. Let B1 be the total # of clauses which would be unsatisfied in T’. The net gain of V is B1-B0. The negative gain of V is the # of clauses which are satisfied in T but unsatisfied in T’. The positive gain of V is the # of clauses which are unsatisfied in T but satisfied in T’. Variable Age The age of a variable is the # of flips since it was last