The MathSAT 3 system

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

Volumn 3632 LNAI, Issue , 2005, Pages 315-321

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

^a ITC IRST   (Italy)

^b AALTO UNIVERSITY   (Finland)

^c RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

^d UNIVERSITY OF VERONA   (Italy)

^e UNIVERSITY OF TRENTO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 26944472817     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11532231_23     Document Type: Conference Paper

References (19)

1. W. Ackermann. Solvable Cases of the Decision Problem. North Holland Pub. Co., Amsterdam, 1954.
2. A. Armando, C. Castellini, E. Giunchiglia, and M. Maratea. A SAT-based Decision Procedure for the Boolean Combination of Difference Constraints, 2004. In SAT 2004 conference.
3. G. Audemard, P. Bertoli, A. Cimatti, A. Korniłowicz, and R. Sebastian. A SAT Based Approach for Solving Formulas over Boolean and Linear Mathematical Propositions. In CADE-18, volume 2392 of LNAI, pages 195-210. Springer, 2002.
4. G. Audemard, P. Bertoli, A. Cimatti, A. Kornitowicz, and R. Sebastiani. Integrating boolean and mathematical solving: Foundations, basic algorithms and requirements. In AISC 2002, volume 2385 of LNAI, pages 231-245. Springer, 2002.
5. G. J. Badros, A. Borning, and P. J. Stuckey. The Cassowary Linear Arithmetic Constraint Solving Algorithm. ACM Trans. on Computer-Human Interaction, 8(4):267-306, 2001.
6. M. Bozzano, R. Bruttomesso, A. Cimatti, T. Junttila, S. Ranise, P. van Rossum, and R. Sebastiani. Efficient Satisfiability Modulo Theories via Delayed Theory Combination. In CAV 2005, LNCS. Springer, 2005.
7. M. Bozzano, R. Bruttomesso, A. Cimatti, T. Junttila, P. van Rossum, S. Schulz, and R. Sebastiani. An incremental and Layered Procedure for the Satisfiability of Linear Arithmetic Logic. In TACAS 2005, volume 3440 of LNCS, pages 317-333. Springer, 2005.
8. M. Bozzano, R. Bruttomesso, A. Cimatti, T. Junttila, P. van Rossum, S. Schulz, and R. Sebastiani. MathSAT: Tight Integration of SAT and Mathematical Decision Procedure. Journal of Automated Reasoning, to appear.
9. B. V. Cherkassky and A. V. Goldberg. Negative-Cycle Detection Algorithms. Mathematical Programming, 85(2):277-311, 1999.
10. N. Eén and N. Sörensson. An extensible SAT-solver. In SAT 2003, volume 2919 of LNCS, pages 502-518. Springer, 2004.
11. C. Flanagan, R. Joshi, X. Ou, and J.B. Saxe. Theorem Proving using Lazy Proof Explication. In CAV 2003, volume 2725 of LNCS, pages 355-367. Springer, 2003.
12. H. Ganzinger, G. Hagen, R. Nieuwenhuis, A. Oliveras, and C. Tinelli. DPLL(T): Fast decision procedures. In CAV 2004, volume 3114 of LNCS, pages 175-188. Springer, 2004.
13. C. P. Gomes, B. Selman, and H. A. Kautz. Boosting Combinatorial Search Through Randomization. In AAAI/IAAI 1998, pages 431-437. AAAI Press / The MIT Press, 1998.
14. J. Jaffar, S. Michaylov, P. J. Stuckey, and R. H. C. Yap. The CLP(R) Language and System. ACM Trans. on Programming Languages and Systems, 14(3):339-395, 1992.
15. J. P. Marques-Silva and K. A. Sakallah. GRASP: A Search Algorithm for Propositional Satisfiability. IEEE Trans. on Computers, 48(5):506-521, 1999.
16. M. W. Moskewicz, C. F. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an Efficient SAT Solver. In DAC2001, pages 530-535. ACM, 2001.
17. R. Nieuwenhuis and A. Oliveras. Congruence Closure with Integer Offsets. In LPAR 2003, volume 2850 of LNAI, pages 78-90. Springer, 2003.
18. Omega, http://www.cs.umd.edu/projects/omega.
19. S. Schulz. E - A Brainiac Theorem Prover. AI Communications, 15(2/3): 111-126, 2002.