Solving systems of linear inequalities by bound propagation

Authors:
Konstantin Korovin;Andrei Voronkov
Affiliations:
The University of Manchester;The University of Manchester
Venue:
CADE'11 Proceedings of the 23rd international conference on Automated deduction
Year:
2011

Citing 6
Cited 3

GRASP: A Search Algorithm for Propositional Satisfiability

IEEE Transactions on Computers
A machine program for theorem-proving

Communications of the ACM
Solving SAT and SAT Modulo Theories: From an abstract Davis--Putnam--Logemann--Loveland procedure to DPLL(T)

Journal of the ACM (JACM)
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
Solving systems of linear inequalities by bound propagation

CADE'11 Proceedings of the 23rd international conference on Automated deduction

Solving systems of linear inequalities by bound propagation

CADE'11 Proceedings of the 23rd international conference on Automated deduction
A simplex-based extension of fourier-motzkin for solving linear integer arithmetic

IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
First-Order theorem proving and vampire

CAV'13 Proceedings of the 25th international conference on Computer Aided Verification

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we introduce a new method for solving systems of linear inequalities. The algorithm incorporates many state-of-the-art techniques from DPLL-style reasoning. We prove soundness, completeness and termination of the method.