The MathSAT 3 System

Satisfiability Modulo Theories (SMT) can be seen as an extended form of propositional satisfiability, where propositions are either simple boolean propositions or quantifier-free atomic constraints in a specific theory.

[1]  Wilhelm Ackermann,et al.  Solvable Cases Of The Decision Problem , 1954 .

[2]  Roland H. C. Yap,et al.  The CLP( R ) language and system , 1992, TOPL.

[3]  Bart Selman,et al.  Boosting Combinatorial Search Through Randomization , 1998, AAAI/IAAI.

[4]  Joao Marques-Silva,et al.  GRASP: A Search Algorithm for Propositional Satisfiability , 1999, IEEE Trans. Computers.

[5]  Andrew V. Goldberg,et al.  Negative-cycle detection algorithms , 1996, Math. Program..

[6]  M. Moskewicz,et al.  Chaff: engineering an efficient SAT solver , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).

[7]  Peter J. Stuckey,et al.  The Cassowary linear arithmetic constraint solving algorithm , 2001, TCHI.

[8]  Piergiorgio Bertoli,et al.  Integrating Boolean and Mathematical Solving: Foundations, Basic Algorithms, and Requirements , 2002, AISC.

[9]  Stephan Schulz,et al.  E - a brainiac theorem prover , 2002, AI Commun..

[10]  Piergiorgio Bertoli,et al.  A SAT Based Approach for Solving Formulas over Boolean and Linear Mathematical Propositions , 2002, CADE.

[11]  Xinming Ou,et al.  Theorem Proving Using Lazy Proof Explication , 2003, CAV.

[12]  Niklas Sörensson,et al.  An Extensible SAT-solver , 2003, SAT.

[13]  Albert Oliveras,et al.  Congruence Closure with Integer Offsets , 2003, LPAR.

[14]  Enrico Giunchiglia,et al.  A SAT-based Decision Procedure for the Boolean Combination of Difference Constraints , 2004, SAT.

[15]  Cesare Tinelli,et al.  DPLL( T): Fast Decision Procedures , 2004, CAV.

[16]  Marco Bozzano,et al.  MathSAT: Tight Integration of SAT and Mathematical Decision Procedures , 2005, Journal of Automated Reasoning.

[17]  Marco Bozzano,et al.  An Incremental and Layered Procedure for the Satisfiability of Linear Arithmetic Logic , 2005, TACAS.

[18]  Marco Bozzano,et al.  Efficient Satisfiability Modulo Theories via Delayed Theory Combination , 2005, CAV.