Implementing conflict resolution

Authors:
Konstantin Korovin;Nestan Tsiskaridze;Andrei Voronkov
Affiliations:
The University of Manchester, UK;The University of Manchester, UK;The University of Manchester, UK
Venue:
PSI'11 Proceedings of the 8th international conference on Perspectives of System Informatics
Year:
2011

Citing 5
Cited 0

CVC3

CAV'07 Proceedings of the 19th 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
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
GoRRiLA and hard reality

PSI'11 Proceedings of the 8th international conference on Perspectives of System Informatics

Quantified Score

Hi-index	0.00

Visualization

Abstract

The conflict resolution method, introduced by the authors in [4] is a new method for solving systems of linear inequalities over the rational and real numbers. This paper investigates various heuristics for optimisation of the method and presents experimental evaluation. The method and heuristics are evaluated against various benchmarks and compared to other methods, such as the Fourier-Motzkin elimination method and the simplex method.