Refinements and independence: A simple method for identifying tractable disjunctive constraints

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

Volumn 1894, Issue , 2000, Pages 114-127

  Broxvall, Mathias ^a   Jonsson, Peter ^a   Renz, Jochen ^a  

^a LINKÖPING UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED ANALYSIS; COMPUTER PROGRAMMING; CONSTRAINT THEORY;

COMBINATORIAL PROBLEM; COMPUTER-ASSISTED ANALYSIS; CONSTRAINT CLASS; DISJUNCTIVE CONSTRAINTS; INDEPENDENCE PROPERTIES; INDEPENDENCE RESULT; POINT ALGEBRAS; TRACTABLE CLASS;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 33646202099     PISSN: 03029743     EISSN: 16113349     Source Type: Journal    
DOI: 10.1007/3-540-45349-0_10     Document Type: Article

References (18)

1. F. Anger, D. Mitra, and R. Rodriguez. Temporal constraint networks in nonlinear time. Technical report, ECAI Workshop on Temporal and Spatial Reasoning, 1998.
2. C. Bessière, A. Isli, and G. Ligozat. Global consistency in interval algebra networks: tractable subclasses. In W. Wahlster, editor, Proceedings of the 12th European Conference on Artificial Intelligence (ECAI-96), pages 3-7, Budapest, Hungary, Aug. 1996. Wiley.
3. M. Broxvall and P. Jonsson. Towards a complete classification of tractability in point algebras for nonlinear time. In Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming (CP-99), pages 448-454, Alexandria, VA, USA, Oct. 1999.
4. M. Broxvall and P. Jonsson. Disjunctive temporal reasoning in partially ordered time structures. In Proceedings of the Seventeenth National Conference on Artificial Intelligence (AAAI-2000). AAAI Press, 2000. To appear.
5. D. Cohen, P. Jeavons, and M. Koubarakis. Tractable disjunctive constraints. In Proceedings of the 3rd International Conference on Principles and Practice for Constraint Programming, pages 478-490, 1997.
6. Y. Deville, O. Barette, and P. van Hentenryck. Constraint satisfaction over connected row convex constraints. Artificial Intelligence, 109(1-2): 243-271, 1999.
7. E. C. Freuder. A sufficient condition for backtrack-bounded search. Journal of the ACM, 32: 755-761, 1985.
8. G. Gottlob, N. Leone, and F. Scarcello. A comparison of structural CSP decomposition methods. In Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI-99), pages 394-399, Stockholm, Sweden, 1999.
9. P. G. Jeavons, D. Cohen and M. Gyssens. A test for tractability. In Proceedings of the 2nd International Conference on Principles and Practice for Constraint Programming, pages 267-281, 1996.
10. P. G. Jeavons and M. C. Cooper. Tractable constraints on ordered domains. Artificial Intelligence, 79: 327-339, 1996.
11. P. Jonsson and T. Drakengren. A complete classification of tractability in RCC-5. Journal of Artificial Intelligence Research, 6: 211-221, 1997.
12. A. K. Mackworth. Consistency in networks of relations. Artificial Intelligence, 8: 99-118, 1977.
13. B. Nebel and H.-J. Bürckert. Reasoning about temporal relations: A maximal tractable subclass of Allen’s interval algebra. Journal of the ACM, 42(1): 43-66, 1995.
14. David A. Randell, Zhan Cui, and Anthony G. Cohn. A spatial logic based on regions and connection. In B. Nebel, W. Swartout, and C. Rich, editors, Principles of Knowledge Representation and Reasoning: Proceedings of the 3rd International Conference, pages 165-176, Cambridge, MA, October 1992. Morgan Kaufmann.
15. J. Renz. Maximal tractable fragments of the Region Connection Calculus: A complete analysis. In Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI-99), pages 129-143, Stockholm, Sweden, 1999.
16. J. Renz and B. Nebel. On the complexity of qualitative spatial reasoning: A maximal tractable fragment of the Region Connection Calculus. Artificial Intelligence, 108(1-2): 69-123, 1999.
17. P. van Beek and R. Dechter. On the minimality and decomposability of row-convex constraint networks. Journal of the ACM, 42: 543-561, 1995.
18. M. B. Vilain, H. Kautz and P. van Beek. Constraint propagation algorithms for temporal reasoning: A revised report. In Readings in Qualitative Reasoning about Physical Systems, pages 373-381. Morgan Kaufmann, San Mateo, CA, 1989.