An incremental and layered procedure for the satisfiability of Linear Arithmetic Logic

Lecture Notes in Computer Science

Volumn 3440, Issue , 2005, Pages 317-333

  Bozzano, Marco ^a   Bruttomesso, Roberto ^a   Cimatti, Alessandro ^a   Junttila, Tommi ^b   Van Rossum, Peter ^a   Schulz, Stephan ^c   Sebastiani, Roberto ^d  

^a ITC IRST   (Italy)

^b AALTO UNIVERSITY   (Finland)

^c UNIVERSITY OF VERONA   (Italy)

^d UNIVERSITY OF TRENTO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN ALGEBRA; CONSTRAINT THEORY; LEARNING SYSTEMS; LINEAR ALGEBRA; PROBLEM SOLVING;

ABSTRACT SOLVERS; BOOLEAN REASONING; LINEAR ARITHMETIC LOGIC (LAL); LINEAR CONSTRAINTS;

FORMAL LOGIC;

EID: 24644470145     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31980-1_21     Document Type: Conference Paper

References (38)

1. W. Ackermann. Solvable Cases of the Decision Problem. North Holland Pub. Co., Amsterdam, 1954.
2. A. Armando, C. Castellini, and E. Giunchiglia. SAT-based procedures for temporal reasoning. In Proc. European Conference on Planning, CP-99, 1999.
3. A. Armando, C. Castellini, E. Giunchiglia, and M. Maratea. A SAT-based Decision Procedure for the Boolean Combination of Difference Constraints. In Proc. Conference on Theory and Applications of Satisfiability Testing (SAT'04), 2004.
4. G. Audemard, P. Bertoli, A. Cimatti, A. Kornitowicz, and R. Sebastiani. A SAT Based Approach for Solving Formulas over Boolean and Linear Mathematical Propositions. In Proc. CADE'2002., volume 2392 of LNAI. Springer, July 2002.
5. G. Audemard, P. Bertoli, A. Cimatti, A. Korniłowicz, and R. Sebastiani. Integrating boolean and mathematical solving: Foundations, basic algorithms and requirements. In Proc. AISC-Calculemus 2002, volume 2385 of LNAI, pages 231-245. Springer, 2002.
6. G. Audemard, M. Bozzano, A. Cimatti, and R. Sebastiani. Verifying Industrial Hybrid Systems with MathSAT. In Proc. of the 1st CADE-19 Workshop on Pragmatics of Decision Procedures in Automated Reasoning (PDPAR'03), 2003.
7. G. Audemard, A. Cimatti, A. Korniłowicz, and R. Sebastiani. SAT-Based Bounded Model Checking for Timed Systems. In Proc. FORTE'02, volume 2529 of LNCS. Springer, 2002.
8. G.J. Badros and A. Borning. The Cassowary linear arithmetic constraint solving algorithm: Interface and implementation. Technical Report UW-CSE-98-06-04, Jun 1998.
9. T. Ball, B. Cook, S.K. Lahiri, and L. Zhang. Zapato: Automatic Theorem Proving for Predicate Abstraction Refinement. In Proc. CAV'04, pages 457-461. Springer, 2004.
10. C. Barrett and S. Berezin. CVC Lite: A New Implementation of the Cooperating Validity Checker. In Proc. CAV'04, volume 3114 of LNCS, pages 515-518. Springer, 2004.
11. R. J. Bayardo, Jr. and R. C. Schrag. Using CSP Look-Back Techniques to Solve Real-World SAT instances. In Proc. AAAI/IAAI'97, pages 203-208. AAAI Press, 1997.
12. A. Bockmayr and V. Weispfenning. Solving Numerical Constraints. In Handbook of Automated Reasoning, pages 751-842. MIT Press, 2001.
13. A. Borning, K. Marriott, P. Stuckey, and Y. Xiao. Solving linear arithmetic constraints for user interface applications. In Proc. VIST'97, pages 87-96. ACM, 1997.
14. M. Bozzano, A. Cimatti, G. Colombini, V. Kirov, and R. Sebastiani. The MathSat solver a progress report. In Proc. Workhop on Pragmatics of Decision Procedures in Automated Reasoning 2004 (PDPAR 2004), 2004.
15. R. Brinkmann and R. Drechsler. RTL-datapath verification using integer linear programming. In Proc. ASP-DAC2002, pages 741-746. IEEE, 2002.
16. Boris V. Cherkassky and Andrew V. Goldberg. Negative-cycle detection algorithms. Mathematical Programming, 85(2):277-311, 1999.
17. CVC, CVCLITE and SVC. http://verify.stanford.edu/{cvc, CVCL, SVC}.
18. N. Eén and N. Sörensson. An extensible SAT-solver. In Theory and Applications of Satisfiability Testing (SAT 2003), volume 2919 of LNCS, pages 502-518. Springer, 2004.
19. J.-C. Fillître, S. Owre, H. Ruess, and N. Shankar. ICS: Integrated Canonizer and Solver. In Proc. Conference on Computer Aided Verification (CAV'01), pages 246-249, 2001.
20. C. Flanagan, R. Joshi, X. Ou, and J.B. Saxe. Theorem Proving using Lazy Proof Explication. In Proc. CAV'03, volume 2725 of LNCS, pages 355-367. Springer, 2003.
21. H. Ganzinger, G. Hagen, R. Nieuwenhuis, A. Oliveras, and C. Tinelli. DPLL(T): Fast decision procedures. In Proc. CAV'04, volume 3114 of LNCS, pages 175-188. Springer, 2004.
22. C. Gomes, B. Selman, and H. Kautz. Boosting Combinatorial Search Through Randomization. In Proceedings of the Fifteenth National Conference on Artificial Intelligence, 1998.
23. I. Horrocks and P. F. Patel-Schneider. FaCT and DLP. In Proc. Tableaux'98, pages 27-30, 1998.
24. ICS. http://www.icansolve.com.
25. D. Kroening, J. Ouaknine, S. Seshia, and O. Strichman. Abstraction-Based Satisfiability Solving of Presburger Arithmetic. In Proc. CAV'04, pages 308-320. Springer, 2004.
26. MATHSAT. http://mathsat.itc.it.
27. M. W. Moskewicz, C. F. Madigan, Y. Z., L. Zhang, and S. Malik. Chaff: Engineering an efficient SAT solver. In Design Automation Conference, 2001.
28. R. Nieuwenhuis and A. Oliveras. Congruence Closure with Integer Offsets. In Proc. 10th LPAR, number 2850 in LNAI, pages 77-89. Springer, 2003.
29. Omega, http://www.cs.umd.edu/projects/omega.
30. G. Parthasarathy, M.K. Iyer, K.-T. Cheng, and Li-C. Wang. An efficient finite-domain constraint solver for circuits. In Proc. DAC'04, pages 212-217. IEEE, 2004.
31. SAL Suite, http://www.csl.sri.com/users/demoura/gdp-benchmarks.html.
32. S. Schulz. E - A Brainiac Theorem Prover. AI Communications, 15(2/3):111-126, 2002.
33. S.A. Seshia, S.K. Lahiri, and R.E. Bryant. A hybrid SAT-based decision procedure for separation logic with uninterpreted functions. In Proc. DAC'03, pages 425-430. ACM, 2003.
34. J. P. M. Silva and K. A. Sakallah. GRASP - A new Search Algorithm for Satisfiability. In Proc. ICCAD'96,1996.
35. TSAT++. http://www.ai.dist.unige.it/Tsat.
36. UCLID. http://www-2.cs.cmu.edu/~uclid.
37. S. Wolfman and D. Weld. The LPSAT Engine & its Application to Resource Planning. In Proc. IJCAI, 1999.
38. L. Zhang and S. Malik. The quest for efficient boolean satisfiability solvers. In Proc. CAV'02, volume 2404 of LNCS, pages 17-36. Springer, 2002.