[1] 陈稳. 基于DPLL的SAT算法的研究及应用[D]. 成都:电子科技大学, 2011.
[2] JACKSON D, VAZIRI M. Finding bugs with a constraint solver[C]// Proceedings of the 2000 ACM SIGSOFT International Symposium on Software Testing and Analysis. 2000:14-25.
[3] VELEV M N, BRYANT R E. Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors[J]. Journal of Symbolic Computation, 2003,35(2):73-106.
[4] KAUTZ H, SELMAN B. The state of SAT[J]. Discrete Applied Mathematics, 2007,155(12):1514-1524.
[5] 张健. 逻辑公式的可满足性判定:方法工具及应用[M]. 北京:科学出版社, 2000:8-20.
[6] DAVIS M, LOGEMANN G, LOVELAND D. A machine program for theorem-proving[J]. Communications of the ACM, 1962,5(7):394-397.
[7] CALABRO C, IMPAGLIAZZO R, PATURI R. A duality between clause width and clause density for SAT[C]// Proceedings of the 21st Annual IEEE Conference on Computational Complexity. 2006:252-260.
[8] JEROSLOW R G, WANG J C. Solving propositional satisfiability problems[J]. Annals of Mathematics and Artificial Intelligence, 1990,1(1-4):167-187.
[9] Buro M, Buning H K. Report on a SAT Competition[R]. University of Paderborn, 1992.
[10]DUBOIS O, ANDRE P, BOUFKHAD Y, et al. SAT versus UNSAT[M]// DIMACS Series in Discrete Mathematics and Theoretical Computer Science. American Mathematical Society, 1996,26:415-434.
[11]MARQUES-SILVA J. The impact of branching heuristics in propositional satisfiability algorithms[C]// Proceedings of the 9th Portuguese Conference on Artificial Intelligence. 1999:62-74.
[12]杜忠和. 基于CDCL结构的SAT问题优化策略的研究[D]. 成都:西南交通大学, 2018.
[13]BIERE A. Lingeling, Plingeling and Treengeling entering the SAT competition 2013[C]// Proceedings of SAT Competition 2013. 2013:51-52.
[14]陈青山,徐扬,何星星. 利用逻辑演绎求解SAT问题的启发式完全算法[J]. 西南交通大学学报, 2017,52(6):1224-1232.
[15]MOSKEWICZ M W, MADIGAN C F, ZHAO Y, et al. Chaff: Engineering an efficient SAT solver[C]// Proceedings of the 38th Annual Design Automation Conference. 2001:530-535.
[16]MARQUES-SILVA J, LYNCE I, MALIK S. Conflict-driven clause learning SAT solvers[M]// Frontiers in Artificial Intelligence and Applications: Handbook of Satisfiability. IOS Press, 2009,185:131-153.
[17]HEULE M J H, KULLMANN O, WIERINGA S, et al. Cube and conquer: Guiding CDCL SAT solvers by lookaheads[C]// Proceedings of the 7th International Haifa Verification Conference on Hardware and Software: Verification and Testing. 2011:50-65.
[18]MAHAJAN Y S, FU Z H, MALIK S. Zchaff2004: An efficient SAT solver[C]// Proceedings of the 7th International Conference on Theory and Applications of Satisfiability Testing. 2004:360-375.
[19]胡容. 基于CDCL的SAT问题的分支启发式策略研究[D]. 成都:西南交通大学, 2018.
[20]EEN N, SORENSSON N. An extensible SAT-solver[C]// Proceedings of the 6th International Conference on Theory and Applications of Satisfiability Testing. 2003:502-518.
[21]BIERE A. Adaptive restart strategies for conflict driven SAT solvers[C]// Proceedings of the 11th International Conference on Theory and Applications of Satisfiability Testing. 2008:28-33.
[22]BIERE A, FROHLICH A. Evaluating CDCL variable scoring schems[C]// Proceedings of the 18th International Conference on Theory and Applications of Satisfiability Testing. 2015:405-422.
[23]陈青山. 基于矛盾体分离的命题逻辑动态自动演绎推理求解系统研究[D]. 成都:西南交通大学, 2018. |