摘要： 可视化计算SAT公式不满足的最小解释； MUStICCa: MUS Extraction with Interactive Choice of Candidates Johannes Dellert, Christian Zielke, and Michael KaufmannUniversity 阅读全文

摘要： 早期对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 阅读全文

摘要： 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 阅读全文

摘要： 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 阅读全文

摘要： Efficient All-UIP Learned Clause Minimization Mathias Fleury and Armin Biere Johannes Kepler University, Linz, Austria {armin.biere, mathias.fleury}@j 阅读全文

摘要： Partitioning Methods for Satisfiability Testing on Large Formulas Tai Joon Park and Allen Van GelderComputer Science Department, 237 BE, University of 阅读全文

摘要： Generalizations of watched literals for backtracking search Allen Van Gelder237 B.E., University of California, Santa Cruz, CA 95064E-mail avg@cs.ucsc 阅读全文

摘要： The Community Structure of Constraint Satisfaction Problems and Its Correlation with Search Time M. Medema and A. Lazovik, "The Community Structure of 阅读全文

摘要： 作者： MDT Lewis，T Schubert，B Becker 摘要： This paper describes a new BCP algorithm that improves the performance of Cha class solvers by reducing the tota 阅读全文

摘要： a highly efficient stochastic version of NETRATE, called INFOPATH Manuel Gomez-Rodriguez, Jure Leskovec, Bernhard Schölkopf:Structure and dynamics of  阅读全文