随笔 - 260  文章 - 0  评论 - 0  阅读 - 52987 
11 2021 档案
文献学习—— Combining Clause Learning and Branch and Bound for MaxSAT
摘要:Combining Clause Learning and Branch and Bound for MaxSAT Chu-Min Li, Zhenxing Xu, Jordi Coll, Felip Manyà, Djamal Habet, Kun He, Combining Clause Le 阅读全文
posted @ 2021-11-22 14:57 海阔凭鱼跃越 编辑
求解器代码分析-Kissat的输出代码
摘要:屏幕输出相关结果分散在多个.c文件中 一个典型的求解输出: 1 Administrator@PC-20170726RROZ /cygdrive/d/SATceshi2021-11 2 $ ./kissat.exe dist8.c.cnf 3 c [ banner ] 4 c 5 c KISSAT S 阅读全文
posted @ 2021-11-20 18:49 海阔凭鱼跃越 编辑
文献学习——Adaptive restart strategies for conflict driven SAT solvers
摘要:Adaptive restart strategies for conflict driven SAT solvers International Conference on Theory and Applications of Satisfiability Testing SAT 2008: Th 阅读全文
posted @ 2021-11-19 10:10 海阔凭鱼跃越 编辑
文献学习——Evaluating CDCL Variable Scoring Schemes
摘要:Evaluating CDCL Variable Scoring Schemes International Conference on Theory and Applications of Satisfiability Testing SAT 2015: Theory and Applicatio 阅读全文
posted @ 2021-11-19 09:22 海阔凭鱼跃越 编辑
文献学习——Minimal unsatisfiable core extraction for SMT
摘要:Minimal unsatisfiable core extraction for SMT O. Guthmann, O. Strichman and A. Trostanetski, "Minimal unsatisfiable core extraction for SMT," 2016 For 阅读全文
posted @ 2021-11-18 11:59 海阔凭鱼跃越 编辑
文献学习——Faster Extraction of High-Level Minimal Unsatisfiable Cores
摘要:Faster Extraction of High-Level Minimal Unsatisfiable Cores Ryvchin V., Strichman O. (2011) Faster Extraction of High-Level Minimal Unsatisfiable Core 阅读全文
posted @ 2021-11-18 11:52 海阔凭鱼跃越 编辑
文献学习——Boosting MUC extraction in unsatisfiable constraint networks
摘要:Boosting MUC extraction in unsatisfiable constraint networks Grégoire, É., Lagniez, JM. & Mazure, B. Boosting MUC extraction in unsatisfiable constrai 阅读全文
posted @ 2021-11-18 11:32 海阔凭鱼跃越 编辑
文献学习——Boosting Minimal Unsatisfiable Core Extraction
摘要:Boosting Minimal Unsatisfiable Core Extraction 阅读全文
posted @ 2021-11-18 11:16 海阔凭鱼跃越 编辑
文献学习——MUStICCa: MUS Extraction with Interactive Choice of Candidates
摘要:可视化计算SAT公式不满足的最小解释; MUStICCa: MUS Extraction with Interactive Choice of Candidates Johannes Dellert, Christian Zielke, and Michael KaufmannUniversity 阅读全文
posted @ 2021-11-18 11:05 海阔凭鱼跃越 编辑
simplify相关代码分析
摘要:早期对SAT求解器代码解读最重要的文献是: [MZ01] M.W. Moskewicz, C.F. Madigan, Y. Zhao, L. Zhang, S. Malik. “Chaff:Engineering an Efficient SAT Solver” in Proc. of the 38 阅读全文
posted @ 2021-11-18 09:32 海阔凭鱼跃越 编辑
文献学习--Deep Cooperation of CDCL and Local Search for SAT
摘要:Deep Cooperation of CDCL and Local Search for SAT Cai S., Zhang X. (2021) Deep Cooperation of CDCL and Local Search for SAT. In: Li CM., Manyà F. (eds 阅读全文
posted @ 2021-11-06 17:22 海阔凭鱼跃越 编辑
文献阅读--An Extensible SAT-solver
摘要:An Extensible SAT-solver Cite this paper as: Eén N., Sörensson N. (2004) An Extensible SAT-solver. In: Giunchiglia E., Tacchella A. (eds) Theory and A 阅读全文
posted @ 2021-11-06 11:05 海阔凭鱼跃越 编辑

点击右上角即可分享
微信分享提示