Tractable disjunctions of linear constraints: basic results and applications to temporal reasoning

@article{Koubarakis2001TractableDO,
  title={Tractable disjunctions of linear constraints: basic results and applications to temporal reasoning},
  author={Manolis Koubarakis},
  journal={Theor. Comput. Sci.},
  year={2001},
  volume={266},
  pages={311-339}
}
We study the problems of deciding consistency and performing variable elimination for disjunctions of linear inequalities and disequations 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… CONTINUE READING
BETA

References

Publications referenced by this paper.
SHOWING 1-10 OF 36 REFERENCES

ackstrom. A unifying approach to temporal constraint reasoning

  • P. Jonsson, B C.
  • Arti cial Intelligence,
  • 1998
Highly Influential
4 Excerpts

ackstrom. A linear programming approach to temporal reasoning

  • P. Jonsson, B C.
  • In Proceedings of AAAI-96,
  • 1996
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…