Tractable disjunctions of linear constraints

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1118, Issue , 1996, Pages 297-307

  Koubarakis, Manolis ^a  

^a UNIVERSITY OF MANCHESTER   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84957867633     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61551-2_82     Document Type: Conference Paper

References (15)

1. Nebel Bernhard and Hans-Jürgen Bürckert. Reasoning about temporal relations: A maximal tractable subclass of Allen's interval algebra. Journal of the ACM, 42(l):43-66, January 1995.
2. B. Grunbaum. Convex Polytopes. John Wiley and Sons, 1967.
3. J.-L. Imbert. Variable Elimination for Generalized Linear Constraints. In Proceedings of the 10th International Conference on Logic Programming, 1993.
4. J.-L. Imbert. Redundancy, Variable Elimination and Linear Disequations. In Proceedings of the International Symposium on Logic Programming, pages 139-153, 1994.
5. J.-L. Imbert and P. van Hentenryck. On the Handling of Disequations in CLP over Linear Rational Arithmetic. In F. Benhamou and A. Colmerauer, editors, Constraint Logic Programming: Selected Research, Logic Programming Series, pages 49-71. MIT Press, 1993.
6. J. Jaffar and M.J. Maher. Constraint Logic Programming: A Survey. Journal of Logic Programming, 19-20:503-581, 1994.
7. P.C. Kanellakis, G.M. Kuper, and P.Z. Revesz. Constraint Query Languages. Journal of Computer and System Sciences, 51:26-52, 1995.
8. M. Koubarakis. Dense Time and Temporal Constraints with ≠.In Principles of Knowledge Representation and Reasoning: Proceedings of the lhird International Conference (KR'92), pages 24-35. Morgan Kaufmann, San Mateo, CA, October 1992.
9. M. Koubarakis. Foundations of Indefinite Constraint Databases. In A Borning, editor, Proceedings of the 2nd International Workshop on the Principles and Practice of Constraint Programming (PPCP'94), volume 874 of Lecture Notes in Computer Science, pages 266-280. Springer Verlag, 1994.
10. M. Koubarakis. From Local to Global Consistency in Temporal Constraint Networks. In Proceedings of the 1st International Conference on Principles and Practice of Constraint Programming (CP'95), volume 976 of LNCS, pages 53-69, Cassis, France, September 1995.
11. Jean-Louis Lassez and Ken McAloon. A Canonical Form for Generalized Linear Costraints. Technical Report RC15004 (#67009), IBM Research Division, T.J. Watson Research Center, 1989.
12. Jean-Louis Lassez and Ken McAloon. A Canonical Form for Generalized Linear Costraints. In TAPSOFT '89, Advanced Seminar on Foundations of Innovative Software Development, Lecture Notes in Computer Science 351, pages 19-27. Springer Verlag, 1989.
13. A. Schrijver, editor. Theory of Integer and Linear Programming. Wiley, 1986.
14. E. Sontag. Real Addition and the Polynomial Time Hierarchy. Information Processing Letters, 20:115-120, 1985.
15. Marc Vilain, Henry Kautz, and Peter van Beek. Constraint Propagation Algorithms for Temporal Reasoning: A Revised Report. In D.S. Weld and J. de Kleer, editors, Readings in Qualitative Reasoning about Physical Systems, pages 373-381. Morgan Kaufmann, 1989.