Generalizing DPLL to richer logics

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5643 LNCS, Issue , 2009, Pages 462-476

  McMillan, Kenneth L ^a   Kuehlmann, Andreas ^a   Sagiv, Mooly ^b  

^a Cadence Research Labs   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN SATISFIABILITY PROBLEMS; MODEL SEARCH; PROPOSITIONAL RESOLUTION; SATISFYING ASSIGNMENTS; THEORY SOLVERS;

BOOLEAN FUNCTIONS;

COMPUTER AIDED ANALYSIS;

EID: 70350241657     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02658-4_35     Document Type: Conference Paper

References (16)

1. Barrett, C., Deters, M., Oliveras, A., Stump, A.: Design and results of the 4th annual satisfiability modulo theories competition, SMT-COMP 2008 (2008) (to appear)
2. Barrett, C., Sebastiani, R., Seshia, S., Tinelli, C.: Satisfiability modulo theories. In: Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.) Handbook of Satisfiability, ch. 8. IOS Press, Amsterdam (2009)
3. Bjørner, N., Dutertre, B., de Moura, L.: Accelerating lemma learning using joins DPPL. In: LPAR (2008)
4. Bozzano, M., Bruttomesso, R., Cimatti, A., Junttila, T.A., Ranise, S., van Rossum, P., Sebastiani, R.: Efficient satisfiability modulo theories via delayed theory combination. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol. 3576, pp. 335-349. Springer, Heidelberg (2005)
5. Cooper, D.C.: Theorem proving in arithmetic without multiplication. Machine Intelligence 7, 91-99 (1972)
6. Cotton, S.: Algebraic satisfiability solving. Personal communication (2009)
7. Davis, M., Logemann, G., Loveland, D.: A machine program for theorem proving. Communications of the ACM 5(7), 394-397 (1962)
8. Davis, M., Putnam, H.: A computing procedure for quantification theory. Journal of the ACM 7(3), 201-215 (1960)
9. Een, N., Biere, A.: Effective preprocessing in SAT through variable and clause elimination. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol. 3569, pp. 61-75. Springer, Heidelberg (2005)
10. Flanagan, C., Joshi, R., Ou, X., Saxe, J.B.: Theorem proving using lazy proof explication. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol. 2725, pp. 355-367. Springer, Heidelberg (2003)
11. Ganzinger, H., Hagen, G., Nieuwenhuis, R., Oliveras, A., Tinelli, C.: DPLL(T): Fast decision procedures. In: Alur, R., Peled, D.A. (eds.) CAV 2004. LNCS, vol. 3114, pp. 175-188. Springer, Heidelberg (2004)
12. Goldwasser, D., Strichman, O., Fine, S.: A theory-based decision heuristic for DPLL(T). In: FMCAD, pp. 1-8 (2008)
13. Koppensteiner, P., Veith, H.: A novel SAT procedure for linear real arithmetic. In: PDPAR (2005)
14. Korovin, K., Voronkov, A.: Integrating linear arithmetic into superposition calculus. In: Duparc, J., Henzinger, T.A. (eds.) CSL 2007. LNCS, vol. 4646, pp. 223-237. Springer, Heidelberg (2007)
15. Strichman, O., Seshia, S.A., Bryant, R.E.: Deciding separation formulas with sat. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404, pp. 209-222. Springer, Heidelberg (2002)
16. Wang, C., Gupta, A., Ganai, M.K.: Predicate learning and selective theory deduction for a difference logic solver. In: DAC, pp. 235-240 (2006)