Cutting to the chase solving linear integer arithmetic

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

Volumn 6803 LNAI, Issue , 2011, Pages 338-353

  Jovanović, Dejan ^a   De Moura, Leonardo ^b  

^a NEW YORK UNIVERSITY   (United States)

^b MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INTEGER ARITHMETIC; LINEAR INTEGER PROGRAMMING;

ALGORITHMS; AUTOMATION;

INTEGER PROGRAMMING;

EID: 80051674761     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-22438-6_26     Document Type: Conference Paper

References (20)

1. Achterberg, T.: SCIP: Solving constraint integer programs. PhD thesis, TU Berlin (2007)
2. Achterberg, T., Koch, T., Martin, A.: MIPLIB 2003. Operations Research Letters 34(4), 361-372 (2006)
3. Berre, D.L., Parrain, A.: The Sat4j library, release 2.2 system description. Journal on Satisfiability, Boolean Modeling and Computation 7, 59-64 (2010)
4. Chvátal, V.: Edmonds polytopes and a hierarchy of combinatorial problems. Discrete Mathematics 4(4), 305-337 (1973)
5. Cooper, D.: Theorem proving in arithmetic without multiplication. Machine Intelligence 7(91-99), 300 (1972)
6. Cotton, S.: Natural domain SMT: A preliminary assessment. In: Chatterjee, K., Henzinger, T.A. (eds.) FORMATS 2010. LNCS, vol. 6246, pp. 77-91. Springer, Heidelberg (2010)
7. Davis, M., Logemann, G., Loveland, D.: A machine program for theorem-proving. Communications of the ACM 5(7), 397 (1962)
8. Davis, M., Putnam, H.: A computing procedure for quantification theory. Journal of the ACM (JACM) 7(3), 201-215 (1960)
9. de Moura, L., Bjørner, N.S.: Z3: An Efficient SMT Solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337-340. Springer, Heidelberg (2008)
10. Dillig, I., Dillig, T., Aiken, A.: Cuts from proofs: A complete and practical technique for solving linear inequalities over integers. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol. 5643, pp. 233-247. Springer, Heidelberg (2009)
11. Dutertre, B., de Moura, L.: A Fast Linear-Arithmetic Solver for DPLL(T). In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 81-94. Springer, Heidelberg (2006) (Pubitemid 44560868)
12. Gomory, R.E.: Outline of an algorithm for integer solutions to linear programs. Bulletin of the American Mathematical Society 64(5), 275-278 (1958)
13. Griggio, A.: A practical approach to SMT(LA(Z)). In: SMT Workshop (2010)
14. Korovin, K., Tsiskaridze, N., Voronkov, A.: Conflict resolution. In: Gent, I.P. (ed.) CP 2009. LNCS, vol. 5732, Springer, Heidelberg (2009)
15. Krstic, S., Goel, A.: Architecting Solvers for SAT Modulo Theories: Nelson-Oppen with DPLL. In: FroCos (2007)
16. McMillan, K.L., Kuehlmann, A., Sagiv, M.: Generalizing DPLL to richer logics. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol. 5643, pp. 462-476. Springer, Heidelberg (2009)
17. Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: engineering an efficient SAT solver. In: DAC (2001)
18. Nieuwenhuis, R., Oliveras, A., Tinelli, C.: Solving SAT and SAT Modulo Theories: From an abstract DPLL procedure to DPLL(T). J. ACM 53(6), 937-977 (2006) (Pubitemid 46276962)
19. Silva, J.P.M., Sakallah, K.A.: GRASP - a new search algorithm for satisfiability. In: ICCAD (1997)
20. Wolsey, L.A., Nemhauser, G.L.: Integer and combinatorial optimization. Wiley, New York (1999)