A complete classification of tractability in RCC-5

Journal of Artificial Intelligence Research

Volumn 6, Issue , 1997, Pages 211-221

  Jonsson, Peter ^a   Drakengren, Thomas ^a  

^a LINKÖPING UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000512594     PISSN: 10769757     EISSN: None     Source Type: Journal    
DOI: 10.1613/jair.379     Document Type: Article

References (16)

1. Baase, S. (1988). Computer Algorithms: Introduction and Analysis (2nd edition). Addison Wesley, Reading, MA.
2. Bennett, B. (1994). Spatial reasoning with prepositional logics. In Doyle, J., Sandewall, E., & Torasso, P. (Eds.), Proceedings of the 4th International Conference on Principles on Knowledge Representation and Reasoning (KR-94), pp. 165-176 Bonn, Germany. Morgan Kaufmann.
3. Cook, S. A. (1971). The complexity of theorem-proving procedures. In Proceedings of the 3rd ACM Symposium on Theory of Computing, pp. 151-158.
4. Cui, Z. (1994). Using interval logic for order assembly. In Proceedings of the Second International Conference on Intelligent Systems for Molecular Biology, pp. 103-111. AAAI Press.
5. Drakengren, T., & Jonsson, P. (1996). Maximal tractable subclasses of Allen's interval algebra: Preliminary report. In Proceedings of the 13th (US) National Conference on Artificial Intelligence (AAAI-96), pp. 389-394 Portland, OR, USA. American Association for Artificial Intelligence.
6. Egenhofer, M. J. (1991). Reasoning about binary topological relations. In Gunther, O., & Schek, H. J. (Eds.), Advances in Spatial Databases, pp. 143-160. Springer-Verlag.
7. Grigni, M., Papadias, D., & Papadimitriou, C. (1995). Topological inference. In Mellish, C. (Ed.), Proceedings of the I4th International Joint Conference on Artificial Intelligence (IJCAI-95), pp. 901-906 Montréal, PQ, Canada. Morgan Kaufmann.
8. Mallios, A. (1986). Topological Algebras. Selected Topics. North-Holland, Amsterdam.
9. Nebel, B. (1995). Computational properties of qualitative spatial reasoning: First results. In Wachsmuth, I., Rollinger, C.-R., & Brauer, W. (Eds.), KI-95: Advances in Artificial Intelligence, pp. 233-244 Bielefeld, Germany. Springer-Verlag.
10. Nebel, B., & Bürckert, H.-J. (1995). Reasoning about temporal relations: A maximal tractable subclass of Allen's interval algebra. Journal of the ACM, 42(1), 43-66.
11. Randell, D. A., & Cohn, A. G. (1989). Modelling topological and metrical properties of physical processes. In Brachman, R. J., Levesque, H. J., & Reiter, R. (Eds.), Proceedings of the 1st International Conference on Principles on Knowledge Representation and Reasoning (KR-89), pp. 55-66 Toronto, ON, Canada. Morgan Kaufmann.
12. Randell, D. A., Cui, Z., & Cohn, A. G. (1992). A spatial logic based on regions and connection. In Swartout, B., & Nebel, B. (Eds.), Proceedings of the 3rd International Conference on Principles on Knowledge Representation and Reasoning (KR-92), pp. 165-176 Cambridge, MA, USA. Morgan Kaufmann.
13. Renz, J. (1996). Qualitatives räumliches Schließen: Berechnungseigenschaften und effiziente Algorithmen. Master thesis report, Fakultät für Informatik, Universität Ulm. Available from http://www.Informatik.uni-freiburg.de/~sppraum.
14. Renz, J., & Nebel, B. (1997). On the complexity of qualitative spatial reasoning: A maximal tractable fragment of the region connected calculus. In Proceedings of the 15th International Joint Conference on Artificial Intelligence (IJCAI-97) Nagoya, Japan. Morgan Kaufmann. To appear.
15. Statman, R. (1979). Intuitionistic logic is polynomial-space complete. Theoretical Computer Science, 9(1), 67-72.
16. van Beek, P. (1992). Reasoning about qualitative temporal information. Artificial Intelligence, 58, 297-326.