Conflict resolution

Konstantin Korovin, Nestan Tsiskaridze, Andrei Voronkov

    Research output: Chapter in Book/Conference proceedingConference contributionpeer-review

    Abstract

    We introduce a new method for solving systems of linear inequalities over the rationals-the conflict resolution method. The method 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. © 2009 Springer Berlin Heidelberg.
    Original languageEnglish
    Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|Lect. Notes Comput. Sci.
    PublisherSpringer Nature
    Pages509-523
    Number of pages14
    Volume5732
    ISBN (Print)3642042430, 9783642042430
    DOIs
    Publication statusPublished - 2009
    Event15th International Conference on Principles and Practice of Constraint Programming, CP 2009 - Lisbon
    Duration: 1 Jul 2009 → …
    http://dblp.uni-trier.de/db/conf/cp/cp2009.html#KorovinTV09http://dblp.uni-trier.de/rec/bibtex/conf/cp/KorovinTV09.xmlhttp://dblp.uni-trier.de/rec/bibtex/conf/cp/KorovinTV09

    Conference

    Conference15th International Conference on Principles and Practice of Constraint Programming, CP 2009
    CityLisbon
    Period1/07/09 → …
    Internet address

    Fingerprint

    Dive into the research topics of 'Conflict resolution'. Together they form a unique fingerprint.

    Cite this