New Techniques that Improve MACE-style Finite Model Finding
暂无分享,去创建一个
[1] Donald W. Loveland,et al. A machine program for theorem-proving , 2011, CACM.
[2] W. McCune. A Davis-Putnam program and its application to finite-order model search: Quasigroup existence problems , 1994 .
[3] Hantao Zhang,et al. SEM: a System for Enumerating Models , 1995, IJCAI.
[4] Hantao Zhang,et al. System Description: Generating Models by SEM , 1996, CADE.
[5] Gilles Audemard,et al. The eXtended Least Number Heuristic , 2001, IJCAR.
[6] M. Moskewicz,et al. Chaff: engineering an efficient SAT solver , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).
[7] Joonyoung Kim,et al. SATIRE: A new incremental satisfiability engine , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).
[8] Matthew W. Moskewicz,et al. Cha : Engineering an e cient SAT solver , 2001, DAC 2001.
[9] Andrei Voronkov,et al. Splitting Without Backtracking , 2001, IJCAI.
[10] Stephan Schulz. A Comparison of Different Techniques for Grounding Near-Propositional CNF Formulae , 2002, FLAIRS Conference.