We study the problems of deciding consistency and performing variable elimination for disjunctions of linear inequalities and inequations with at most one inequality per disjunction. This new class of constraints extends the class of generalized linear constraints originally studied by Lassez and McAloon. We show that deciding consistency of a set of constraints in this class can be done in polynomial time. We also present a variable elimination algorithm which is similar to Fourier's algorithm for linear inequalities.
CITATION STYLE
Koubarakis, M. (1996). Tractable disjunctions of linear constraints. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1118, pp. 297–307). Springer Verlag. https://doi.org/10.1007/3-540-61551-2_82
Mendeley helps you to discover research relevant for your work.