MathSAT: Tight Integration of SAT and Mathematical Decision Procedures
- 1 October 2005
- journal article
- research article
- Published by Springer Nature in Journal of Automated Reasoning
- Vol. 35 (1-3) , 265-293
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- An Incremental and Layered Procedure for the Satisfiability of Linear Arithmetic LogicLecture Notes in Computer Science, 2005
- Some Progress in Satisfiability Checking for Difference Logic2004
- Zapato: Automatic Theorem Proving for Predicate Abstraction RefinementLecture Notes in Computer Science, 2004
- RTL-datapath verification using integer linear programming2003
- A SAT Based Approach for Solving Formulas over Boolean and Linear Mathematical Propositions2002
- ICS: Integrated Canonizer and Solver?2001
- Solving Numerical Constraints2001
- SAT-Based Procedures for Temporal ReasoningLecture Notes in Computer Science, 2000
- Negative-cycle detection algorithmsMathematical Programming, 1999
- Solving linear arithmetic constraints for user interface applications1997