Lemma learning in SMT on linear constraints

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

Volumn 4121 LNCS, Issue , 2006, Pages 142-155

  Yu, Yinlei ^a   Malik, Sharad ^a  

^a Princeton University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; BOOLEAN ALGEBRA; CONSTRAINT THEORY; DIGITAL ARITHMETIC; INTEGER PROGRAMMING; PROBLEM SOLVING;

ARITHMETIC CONSTRAINTS; BOOLEAN CONSTRAINTS; LINEAR REAL ARITHMETIC; SATISFIABILITY MODULO THEORIES (SMT);

LEARNING SYSTEMS;

EID: 33749582869     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11814948_17     Document Type: Conference Paper

References (23)

1. Sofware Design Group, MIT: The Alloy Analyzer. (2006) http: //alloy.mit.edu/ as retrieved on May 12, 2006.
2. Detlefs, D., Nelson, G., Saxe, J.B.: Simplify: a theorem prover for program checking. Journal of the ACM 52(3) (2005) 365-473
3. Marques-Silva, J.P., Sakallah, K.A.: GRASP - a search algorithm for propositional satisfiability. IEEE Transactions on Computers 48(5) (1999) 506-521
4. Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an efficient SAT solver. In: Proc. DAC. (2001) 530-535
5. Zhang, L., Madigan, C.F., Moskewicz, M.W., Malik, S.: Efficient conflict driven learning in a Boolean satisfiability solver. In: Proc. ICCAD. (2001)
6. Davis, M., Putnam, H.: A computing procedure for quantification theory. Journal of the ACM 7(3) (1960) 201-215
7. Davis, M., Logemann, G., Loveland, D.: A machine program for theorem proving. Communications of the ACM 5(7) (1962) 394 - 397
8. Nelson, G., Oppen, D.C.: Simplification by cooperating decision procedures. ACM Transactions on Programming Languages and Systems 1 (1979) 245-257
9. Horning, A., Marriott, K., Stuckey, P., Xiao, Y.: Solving linear arithmetic constraints for user interface applications. In: Proc. ACM Symp. on User Interface Software and Technology. (1996) 87-96
10. ILog S. A.: CPLEX Manual, Version 10.0. (2006)
11. Dash optimization Inc.: Xpress-MP optimization software (2006) http://www. dashoptimization.com/.
12. Mosek ApS: MOSEKoptimization software (2006) http: //www.mosek.com/.
13. Sheini, H.M., Sakallah, K.A.: A scalable method for solving satisfiability of integer linear arithmetic logic. In: Proc. SAT. Volume 3569 of LNCS. (2005) 241-256
14. Bozza M., Bruttomesso, R., Cimatti, A., Junttila, T., van Rossum, P., Schulz, S., Sebastian!, R.: An incremental and layered procedure for the satisfiability of linear arithmetic logic. In: Proc. TACAS. Volume 3440 of LNCS. (2005) 317-333
15. Barrett, C., Dill, D.L., Stump, A.: Checking satisfiability of first-order formulas by incremental translation into SAT. In: Proc. CAV. Volume 2404 of LNCS. (2002)
16. Nieuwenhuis, R., Oliveras, A.: DPLL(T) with Exhaustive Theory Propagation and its Application to Difference Logic. In: Proc. CAV Volume 3576 of LNCS. (2005) 321-334
17. Rueß, H., Shankar, N.: Solving linear arithmetic constraints. Technical report, SRI International (2004)
18. Chinneck, J.W.: MINOS(IIS): Infeasibility analysis using MINOS. Computers and Operations Research 21(1) (1994) 1-9
19. Guieu, O., Chinneck, J.W.: Analyzing infeasible mixed-integer and integer linear programs. INFORMS J. of Computing 11(1) (1999) 63-77
20. Ranise, S., Tinelli, C.: The SMT-LIB standard: Version 1.1 (2005) http://combination. cs.uiowa.edu/smtlib/papers/format-v 1.1 -r05.04.12.pdf.
21. Bjesse, P., Borälv, A.: DAG-aware circuit compression for formal verification. In: Proc. ICCAD. (2004) 42-49
22. Dutertre, B., de Moura, L.: Simplics: Tool description (2005) http: //fm.csl.sri. com/simplies /description.pdf as retrieved on May 12, 2006.
23. Barrett, C., de Moura, L., Stump, A.: SMT-COMP: Satisfiability modulo theories competition. In: Proc. CAV. Volume 3576 of LNCS. (2005) 20-23