Cutting to the Chase solving linear integer arithmetic

Authors:
Dejan Jovanović;Leonardo de Moura
Affiliations:
New York University;Microsoft Research
Venue:
CADE'11 Proceedings of the 23rd international conference on Automated deduction
Year:
2011

Citing 13
Cited 6

GRASP—a new search algorithm for satisfiability

Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design
A Computing Procedure for Quantification Theory

Journal of the ACM (JACM)
A machine program for theorem-proving

Communications of the ACM
Chaff: engineering an efficient SAT solver

Proceedings of the 38th annual Design Automation Conference
Solving SAT and SAT Modulo Theories: From an abstract Davis--Putnam--Logemann--Loveland procedure to DPLL(T)

Journal of the ACM (JACM)
Architecting Solvers for SAT Modulo Theories: Nelson-Oppen with DPLL

FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
Cuts from Proofs: A Complete and Practical Technique for Solving Linear Inequalities over Integers

CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Generalizing DPLL to Richer Logics

CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Conflict resolution

CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Z3: an efficient SMT solver

TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Natural domain SMT: a preliminary assessment

FORMATS'10 Proceedings of the 8th international conference on Formal modeling and analysis of timed systems
A fast linear-arithmetic solver for DPLL(T)

CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
MIPLIB 2003

Operations Research Letters

Numeric bounds analysis with conflict-driven learning

TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems
A simplex-based extension of fourier-motzkin for solving linear integer arithmetic

IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
Solving non-linear arithmetic

IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
Abstract conflict driven learning

POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
ILP modulo theories

CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
The strategy challenge in SMT solving

Automated Reasoning and Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe a new algorithm for solving linear integer programming problems. The algorithm performs a DPLL style search for a feasible assignment, while using a novel cut procedure to guide the search away from the conflicting states.