A Scalable Method for Solving Satisfiability of Integer Linear Arithmetic Logic
- 1 January 2005
- book chapter
- Published by Springer Nature
- p. 241-256
- https://doi.org/10.1007/11499107_18
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- An Incremental and Layered Procedure for the Satisfiability of Linear Arithmetic LogicPublished by Springer Nature ,2005
- Abstraction-Based Satisfiability Solving of Presburger ArithmeticPublished by Springer Nature ,2004
- DPLL(T): Fast Decision ProceduresPublished by Springer Nature ,2004
- An Experimental Evaluation of Ground Decision ProceduresPublished by Springer Nature ,2004
- GRASP: a search algorithm for propositional satisfiabilityIEEE Transactions on Computers, 1999
- Validity checking for combinations of theories with equalityPublished by Springer Nature ,1996
- Compact normal forms in propositional logic and integer programming formulationsComputers & Operations Research, 1990
- Deciding Combinations of TheoriesJournal of the ACM, 1984
- Deciding Linear Inequalities by Computing Loop ResiduesJournal of the ACM, 1981
- Simplification by Cooperating Decision ProceduresACM Transactions on Programming Languages and Systems, 1979