Tractability results in the block algebra

Journal of Logic and Computation

Volumn 12, Issue 5, 2002, Pages 885-909

  Balbiani, Philippe ^a   Condotta, Jean François ^a   Fariñas Del Cerro, Luis ^a  

^a IRIT   (France)

Author keywords

Block algebra; Consistency problem; Interval algebra; Qualitative constraints; Spatial reasoning

Indexed keywords

ALGEBRA; ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; POLYNOMIALS;

BLOCK ALGEBRA; SPATIAL REASONING;

FORMAL LOGIC;

EID: 0036800627     PISSN: 0955792X     EISSN: None     Source Type: Journal    
DOI: 10.1093/logcom/12.5.885     Document Type: Article

References (25)

1. J.F. Allen. Maintaining knowledge about temporal intervals. Communications of the ACM, 26, 832-843, 1983.
2. P. Balbiani, J.-F. Condotta, and L. Fariñas del Cerro. A model for reasoning about bidimensional temporal relations. In Proceedings of the Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR'98), A.G. Cohn, L. Schubert, and S.C. Shapiro, eds, pp. 124-130. Morgan Kaufmann, 1998.
3. P. Balbiani, J.-F. Condotta, and L. Fariñas del Cerro. A new tractable subclass of the rectangle algebra. In Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence (IJCAI'99), T. Dean, ed., pp. 442-447, 1999.
4. P. Balbiani, J.-F. Condotta, and L. Fariñas del Cerro. A tractable subclass of the block algebra: constraint propagation and preconvex relations. In The Ninth Portuguese Conference on Artificial Intelligence (EPIA '99), vora, Portugal, pp. 75-89, 1999.
5. P. Van Beek. Exact and Approximate Reasoning about Qualitative Temporal Relations. PhD thesis, University of Alberta, Canada, 1990.
6. P. Van Beek. Reasoning about qualitative temporal information. In Proceedings of the Eighth National Conference on Artificial Intelligence (AAAI'90), pp. 728-734, 1990.
7. J.-F. Condotta. Problèmes de satisfaction de contraintes spatiales: algorithmes et complexité. PhD thesis, Université Paul Sabatier, France, janvier 2000.
8. J.-F. Condotta. The augmented interval and rectangle networks. In Proceedings of the Seventh International Conference on Principles of Knowledge Representation and Reasoning (KR2000), pp. 575-579. Morgan Kaufmann, 2000.
9. R. Dechter, I. Meiri, and J. Pearl. Temporal constraint networks. Artificial Intelligence, 49, 61-95, 1991.
10. M.R. Garey and D.S. Johnson. Computers and Intractibility, A Guide to the Theory of NP-Completeness. Freeman, New York, 1979.
11. H.W. Güsgen. Spatial reasoning based on Allen's temporal logic. Technical Report TR-89-049, International Computer Science Institute, Berkeley, 1989.
12. G. Ligozat. Tractable relations in temporal reasoning: pre-convex relations. In Proceedings of the ECAI Workshop on Spatial and Temporal Reasoning, Amsterdam, pp. 99-108, 1994.
13. G. Ligozat. A New Proof of Tractability for ORD-Horn Relations. In Proceedings of the Thirteenth National Conference on Artificial Intelligence (AAAI'96), volume 1, pp. 395-401, 1996.
14. A.K. Mackworth and E.C. Freuder. The complexity of some polynomial network consistency algorithms for constraint satisfaction problem. Artificial Intelligence, 25, 65-74, 1985.
15. U. Montanari. Networks of constraints: Fundamental properties and application to picture processing. Informa-tion Sciences, 7, 95-132, 1974.
16. A. Mukerjee and G. Joe. A qualitative model for space. In Proceedings of the Eight National Conference on Artificial Intelligence (AAAI'90), volume 2, pp. 721-727, 1990.
17. 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, 43-66, 1995.
18. K. Nökel. Temporally distributed symptoms in technical diagnosis. Lecture Notes in Computer Science, 517, 1-184, 1991.
19. D. Papadias and Y. Theodoridis. Spatial relations, minimum bounding rectangles, and spatial data structures. International Journal of Geographical Information Science, 11, 111-138, 1997.
20. D. Papadias, Y. Theodoridis, T. Sellis, and M.J. Egenhnfer. Topological relations in the world of minimum bounding rectangles: a study with R-trees. SIGMOD Record (ACM Special Interest Group on Management of Data), 24, 92-103, 1995.
21. D.A. Randell, Z. Cui, and A.G. Cohn. A spatial logic based on regions and connection. In Proceedings of the Third International Conference on Principles of Knowledge Representation and Reasoning (KR'92), B. Nebel and C. Rich, eds, pp. 165-176. Morgan Kaufmann, 1992.
22. I. Renz. Maximal tractable fragments of the region connection calculus: a complete analysis. In Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence (IJCAI'99), Stockholm, Sweden, 1999.
23. J. Renz and B. Nebel. On the complexity of qualitative spatial reasoning: a maximal tractable fragment of the region connection calculus. In Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence (IJCAI'97), pp. 522-527. Morgan Kaufmann, 1997.
24. Y. Theodoridis, D. Papadias, E. Stefanakis, and T.K. Sellis. Direction relations and two-dimensional range queries: Optimisation techniques. Data and Knowledge Engineering, 27, 313-336, 1998.
25. M. Vilain and H. Kautz. Constraint propagation algorithms for temporal reasoning. In Proceedings of the Fifth National Conference on Artificial Intelligence (AAAI'86), T. Kehler and S. Rosenschein, eds, pp. 377-382. American Association for Artificial Intelligence, Morgan Kaufmann, 1986.