暂无分享,去创建一个
[1] Sharad Malik,et al. Boolean Satisfiability Solvers and Their Applications in Model Checking , 2015, Proceedings of the IEEE.
[2] Niklas Sörensson,et al. Translating Pseudo-Boolean Constraints into SAT , 2006, J. Satisf. Boolean Model. Comput..
[3] Randal E. Bryant,et al. Microprocessor Verification Using Efficient Decision Procedures for a Logic of Equality with Uninterpreted Functions , 1999, TABLEAUX.
[4] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.
[5] Inês Lynce,et al. Conflict-Driven Clause Learning SAT Solvers , 2009, Handbook of Satisfiability.
[6] Robert K. Brayton,et al. Combinational test generation using satisfiability , 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[7] Randal E. Bryant,et al. Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors , 2003, J. Symb. Comput..
[8] James M. Crawford,et al. Experimental Results on the Crossover Point in Random 3-SAT , 1996, Artif. Intell..
[9] Bart Selman,et al. Pushing the Envelope: Planning, Propositional Logic and Stochastic Search , 1996, AAAI/IAAI, Vol. 2.
[10] Donald W. Loveland,et al. A machine program for theorem-proving , 2011, CACM.
[11] Armin Biere,et al. Bounded Model Checking Using Satisfiability Solving , 2001, Formal Methods Syst. Des..
[12] Hilary Putnam,et al. A Computing Procedure for Quantification Theory , 1960, JACM.