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 language | English |
|---|---|
| Title of host publication | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|Lect. Notes Comput. Sci. |
| Publisher | Springer Nature |
| Pages | 509-523 |
| Number of pages | 14 |
| Volume | 5732 |
| ISBN (Print) | 3642042430, 9783642042430 |
| DOIs | |
| Publication status | Published - 2009 |
| Event | 15th 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
| Conference | 15th International Conference on Principles and Practice of Constraint Programming, CP 2009 |
|---|---|
| City | Lisbon |
| Period | 1/07/09 → … |
| Internet address |