Conflict resolution

Authors:
Konstantin Korovin;Nestan Tsiskaridze;Andrei Voronkov
Affiliations:
The University of Manchester;The University of Manchester;The University of Manchester
Venue:
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Year:
2009

Citing 5
Cited 7

Theory of linear and integer programming

Theory of linear and integer programming
Projecting CLP( R ) constraints

Selected papers of international conference on Fifth generation computer systems 92
A Note on Redundant Linear Constraints

A Note on Redundant Linear Constraints
CVC3

CAV'07 Proceedings of the 19th international conference on Computer aided verification
Decision procedures for SAT, SAT modulo theories and beyond. the barcelogictools

LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning

Natural domain SMT: a preliminary assessment

FORMATS'10 Proceedings of the 8th international conference on Formal modeling and analysis of timed systems
Cutting to the Chase solving linear integer arithmetic

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
Linear quantifier elimination as an abstract decision procedure

IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
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
Implementing conflict resolution

PSI'11 Proceedings of the 8th international conference on Perspectives of System Informatics
Solving non-linear arithmetic

IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce a new method for solving systems of linear inequalities over the rationals--the conflict resolution method. Themethod successively refines an initial assignment with the help of newly derived constraints until either the assignment becomes a solution of the system or a trivially unsatisfiable constraint is derived. We show that this method is correct and terminating. Our experimental results show that conflict resolution outperforms the Fourier-Motzkin method and the Chernikov algorithm, in some cases by orders of magnitude.