An Incremental and Layered Procedure for the Satisfiability of Linear Arithmetic Logic
- 1 January 2005
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- A SAT-Based Decision Procedure for the Boolean Combination of Difference ConstraintsPublished by Springer Nature ,2005
- An Extensible SAT-solverPublished by Springer Nature ,2004
- CVC Lite: A New Implementation of the Cooperating Validity CheckerPublished by Springer Nature ,2004
- Bounded Model Checking for Timed SystemsPublished by Springer Nature ,2002
- A SAT Based Approach for Solving Formulas over Boolean and Linear Mathematical PropositionsPublished by Springer Nature ,2002
- Integrating Boolean and Mathematical Solving: Foundations, Basic Algorithms, and RequirementsPublished by Springer Nature ,2002
- ICS: Integrated Canonizer and Solver?Published by Springer Nature ,2001
- Solving Numerical ConstraintsPublished by Elsevier ,2001
- Negative-cycle detection algorithmsMathematical Programming, 1999
- Solving linear arithmetic constraints for user interface applicationsPublished by Association for Computing Machinery (ACM) ,1997