Splitting on Demand in SAT Modulo Theories
暂无分享,去创建一个
Cesare Tinelli | Albert Oliveras | Robert Nieuwenhuis | Clark W. Barrett | C. Tinelli | R. Nieuwenhuis | Albert Oliveras
[1] Donald W. Loveland,et al. A machine program for theorem-proving , 2011, CACM.
[2] Greg Nelson,et al. Simplification by Cooperating Decision Procedures , 1979, TOPL.
[3] David L. Dill,et al. A decision procedure for an extensional theory of arrays , 2001, Proceedings 16th Annual IEEE Symposium on Logic in Computer Science.
[4] David L. Dill,et al. Checking Satisfiability of First-Order Formulas by Incremental Translation to SAT , 2002, CAV.
[5] Sergey Berezin,et al. CVC Lite: A New Implementation of the Cooperating Validity Checker Category B , 2004, CAV.
[6] Clark W. Barrett,et al. Ph.D. thesis: Checking the validity of quantifier-free formulas in combinations of first-order theories , 2003 .
[7] Calogero G. Zarba,et al. A New Fast Tableau-Based Decision Procedure for an Unquantified Fragment of Set Theory , 1998, FTP.
[8] David L. Dill,et al. Validity Checking for Combinations of Theories with Equality , 1996, FMCAD.
[9] Cesare Tinelli,et al. A New Correctness Proof of the {Nelson-Oppen} Combination Procedure , 1996, FroCoS.
[10] Cesare Tinelli,et al. Abstract DPLL and Abstract DPLL Modulo Theories , 2005, LPAR.
[11] Aaron Stump,et al. SMT-COMP: Satisfiability Modulo Theories Competition , 2005, CAV.
[12] Cesare Tinelli,et al. DPLL( T): Fast Decision Procedures , 2004, CAV.
[13] Hilary Putnam,et al. A Computing Procedure for Quantification Theory , 1960, JACM.
[14] Marco Bozzano,et al. Efficient theory combination via boolean search , 2006, Inf. Comput..