Combining spatial and temporal logics: Expressiveness vs. Complexity

Journal of Artificial Intelligence Research

Volumn 23, Issue , 2005, Pages 167-243

  Gabelaia, David ^a   Kontchakov, Roman ^a   Kurucz, Agi ^a   Wolter, Frank ^b   Zakharyaschev, Michael ^a  

^a KING'S COLLEGE LONDON   (United Kingdom)

^b UNIVERSITY OF LIVERPOOL   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; HIERARCHICAL SYSTEMS; RELIABILITY;

COMPUTATIONAL REALISABILITY; SPATIAL LOGICS; SPATIO-TEMPORAL FORMALISMS;

FORMAL LOGIC;

EID: 24644474664     PISSN: 10769757     EISSN: 10769757     Source Type: Journal    
DOI: 10.1613/jair.1537     Document Type: Article

References (94)

1. Aiello, M., & van Benthem, J. (2002a). Logical patterns in space. In Barker-Plummer, D., Beaver, D. I., van Benthem, J., & Scotto di Luzio, P. (Eds.), Words, Proofs and Diagrams, pp. 5-25. CSLI Publications, Stanford.
2. Aiello, M., & van Benthem, J. (2002b). A modal walk through space. Journal of Applied Non-Classical Logics, 12(3-4), 319-364.
3. Alexandroff, P. (1937). Diskrete Räume. Matematicheskii Sbornik, 2 (44), 501-518.
4. Allen, J. (1983). Maintaining knowledge about temporal intervals. Communications of the ACM, 26, 832-843.
5. Areces, C., Blackburn, P., & Marx, M. (2000). The computational complexity of hybrid temporal logics. Logic Journal of the IGPL, 8, 653-679.
6. Arhangel'skii, A., & Collins, P. (1995). On submaximal spaces. Topology and its Applications, 64, 219-241.
7. Asher, N., & Vieu, L. (1995). Toward a geometry of common sense: A semantics and a complete axiomatization of mereotopology. In Mellish, C. (Ed.), Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI-95), pp. 846-852. Morgan Kaufmann.
8. Balbiani, P., & Condotta, J.-F. (2002). Computational complexity of propositional linear temporal logics based on qualitative spatial or temporal reasoning. In Armando, A. (Ed.), Proceedings of Frontiers of Combining Systems (FroCoS 2002), Vol. 2309 of Lecture Notes in Computer Science, pp. 162-176. Springer.
9. Balbiani, P., Tinchev, T., & Vakarelov, D. (2004). Modal logics for region-based theories of space. Manuscript.
10. Bennett, B. (1994). Spatial reasoning with propositional logic. In Proceedings of the 4th International Conference on Knowledge Representation and Reasoning, pp. 51-62. Morgan Kaufmann.
11. Bennett, B. (1996). Modal logics for qualitative spatial reasoning. Logic Journal of the IGPL, 4, 23-45.
12. Bennett, B., & Cohn, A. (1999). Multi-dimensional multi-modal logics as a framework for spatio-temporal reasoning. In Proceedings of the 'Hot topics in Spatio-temporal reasoning' workshop, IJCAI-99, Stockholm.
13. Bennett, B., Cohn, A., Wolter, F., & Zakharyschev, M. (2002). Multi-dimensional modal logic as a framework for spatio-temporal reasoning. Applied Intelligence, 17, 239-251.
14. Blackburn, P. (1992). Fine grained theories of time. In Aurnague, M., Borillo, A., Borillo, M., & Bras, M. (Eds.), Proceedings of the 4th European Workshop on Semantics of Time, Space, and Movement and Spatio-Temporal Reasoning, pp. 299-320, Château de Bonas, France. Groupe "Langue, Raisonnement, Calcul", Toulouse.
15. Börger, E., Grädel, E., & Gurevich, Y. (1997). The Classical Decision Problem. Perspectives in Mathematical Logic. Springer.
16. Bourbaki, N. (1966). General topology, Part 1. Hermann, Paris and Addison-Wesley.
17. Chagrov, A., & Zakharyaschev, M. (1997). Modal Logic, Vol. 35 of Oxford Logic Guides. Clarendon Press, Oxford.
18. Chlebus, B. (1986). Domino-tiling games. Journal of Computer and System Sciences, 32, 374-392.
19. Clarke, B. (1981). A calculus of individuals based on 'connection'. Notre Dame Journal of Formal Logic, 23, 204-218.
20. Clarke, B. (1985). Individuals and points. Notre Dame Journal of Formal Logic, 26, 61-75.
21. Clarke, E., & Emerson, E. (1981). Design and synthesis of synchronisation skeletons using branching time temporal logic. In Kozen, D. (Ed.), Logic of Programs, Vol. 131 of Lecture Notes in Computer Science, pp. 52-71. Springer.
22. Clementini, E., Di Felice, P., & Hernández, D. (1997). Qualitative representation of positional information. Artificial Intelligence, 95, 317-356.
23. Cohn, A. (1997). Qualitative spatial representation and reasoning techniques. In Brewka, G., Habel, C., & Nebel, B. (Eds.), KI-97: Advances in Artificial Intelligence, Vol. 1303 of Lecture Notes in Computer Science, pp. 1-30. Springer.
24. Davis, E. (1990). Representations of Commonsense Knowledge. Morgan Kaufmann.
25. Degtyarev, A., Fisher, M., & Konev, B. (2003). Monodic temporal resolution. In Baader, F. (Ed.), Proceedings of the 19th International Conference on Automated Deduction (CADE-19), Vol. 2741 of Lecture Notes in Artificial Intelligence, pp. 397-411. Springer.
26. Demri, S., & D'Souza, D. (2002). An automata-theoretic approach to constraint LTL. In Agrawal, M., & Seth, A. (Eds.), Proceedings of the 22nd Conference on Foundations of Software Technology and Theoretical Computer Science (FST TCS 2002), Vol. 2556 of Lecture Notes in Computer Science, pp. 121-132. Springer.
27. Egenhofer, M., & Franzosa, R. (1991). Point-set topological spatial relations. International Journal of Geographical Information Systems, 5, 161-174.
28. Egenhofer, M., & Herring, J. (1991). Categorizing topological relationships between regions, lines and points in geographic databases. Tech. rep., University of Maine.
29. Egenhofer, M., & Sharma, J. (1993). Assessing the consistency of complete and incomplete topological information. Geographical Systems, 1, 47-68.
30. Emerson, E., & Halpern, J. (1985). Decision procedures and expressiveness in the temporal logic of branching time. Journal of Computer and System Sciences, 30, 1-24.
31. Fine, K. (1974). Logics containing K4, part I. Journal of Symbolic Logic, 39, 229-237.
32. Finger, M., & Gabbay, D. (1992). Adding a temporal dimension to a logic system. Journal of Logic, Language and Information, 2, 203-233.
33. Fisher, M., Dixon, C., &: Peim, M. (2001). Clausal temporal resolution. ACM Transactions on Computational Logic (TOCL), 2, 12-56.
34. Gabbay, D., Hodkinson, I., & Reynolds, M. (1994). Temporal Logic: Mathematical Foundations and Computational Aspects, Volume 1. Oxford University Press.
35. Galton, A., & Meathrel, R. (1999). Qualitative outline theory. In Dean, T. (Ed.), Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI-99), pp. 1061-1066. Morgan Kaufmann.
36. Gerevini, A., & Nebel, B. (2002). Qualitative spatio-temporal reasoning with RCC-8 and Alien's interval calculus: Computational complexity. In Proceedings of the 15th European Conference on Artificial Intelligence (ECAI'02), pp. 312-316. IOS Press.
37. Gerevini, A., & Renz, J. (2002). Combining topological and size constraints for spatial reasoning. Artificial Intelligence, 137, 1-42.
38. Gödel, K. (1933). Eine Interpretation des intuitionistischen Aussagenkalküls. Ergebnisse eines mathematischen Kolloquiums, 4, 39-40.
39. Goldblatt, R. (1976). Metamathematics of modal logic, Part I. Reports on Mathematical Logic, 6, 41-78.
40. Goranko, V., & Passy, S. (1992). Using the universal modality: gains and questions. Journal of Logic and Computation, 2, 5-30.
41. Gotts, N. (1996). An axiomatic approach to topology for spatial information systems. Tech. rep. 96.25, School of Computer Studies, University of Leeds.
42. Halpern, J., & Shoham, Y. (1986). A propositional modal logic of time intervals. In Proceedings of the 1st Annual IEEE Symposium on Logic in Computer Science (LICS'86), pp. 279-292. IEEE Computer Society.
43. Halpern, J., & Vardi, M. (1989). The complexity of reasoning about knowledge and time I: lower bounds. Journal of Computer and System Sciences, 38, 195-237.
44. Hodkinson, I. (2004). Complexity of monodic packed fragment over linear and real time. To appear in Annals of Pure and Applied Logic, available at http://www.doc.ic.ac.uk//~imh/papers/cxmonlin.pdf.
45. Hodkinson, I., Kontchakov, R., Kurucz, A., Wolter, F., & Zakharyaschev, M. (2003). On the computational complexity of decidable fragments of first-order linear temporal logics. In Reynolds, M., & Sattar, A. (Eds.), Proceedings of TIME-ICTL 2003, pp. 91-98. IEEE Computer Society.
46. Hodkinson, I., Wolter, F., & Zakharyaschev, M. (2000). Decidable fragments of first-order temporal logics. Annals of Pure and Applied Logic, 106, 85-134.
47. Hodkinson, I., Wolter, F., & Zakharyaschev, M. (2001). Monodic fragments of first-order temporal logics: 2000-2001 A.D. In Nieuwenhuis, R., & Voronkov, A. (Eds.), Logic for Programming, Artificial Intelligence and Reasoning, Vol. 2250 of Lecture Notes in Artificial Intelligence, pp. 1-23. Springer.
48. Hodkinson, I., Wolter, F., & Zakharyaschev, M. (2002). Decidable and undecidable fragments of first-order branching temporal logics. In Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science (LICS 2002), pp. 393-402. IEEE Computer Society.
49. Hughes, G., & Cresswell, M. (1996). A New Introduction to Modal Logic. Methuen, London.
50. Hustadt, U., & Konev, B. (2003). TRP++ 2.0: A temporal resolution prover. In Baader, F. (Ed.), Proceedings of the 19th International Conference on Automated Deduction (CADE-19), Vol. 2741 of Lecture Notes in Computer Science, pp. 274-278. Springer.
51. Kontchakov, R., Lutz, C., Wolter, F., & Zakharyaschev, M. (2004). Temporalising tableaux. Studia Logica, 76, 91-134.
52. Kutz, O., Sturm, H., Suzuki, N.-Y., Wolter, F., & Zakharyaschev, M. (2003). Logics of metric spaces. ACM Transactions on Computational Logic, 4, 260-294.
53. Ladner, R. (1977). The computational complexity of provability in systems of modal logic. SIAM Journal on Computing, 6, 467-480.
54. Lemon, O., & Pratt, I. (1998). On the incompleteness of modal logics of space: advancing complete modal logics of place. In Kracht, M., de Rijke, M., Wansing, H., & Zakharyaschev, M. (Eds.), Advances in Modal Logic, Volume 1, pp. 115-132. CSLI Publications, Stanford.
55. Lewis, C., & Langford, C. (1932). Symbolic Logic. Appleton-Century-Crofts, New York.
56. Ligozat, G. (1998). Reasoning about cardinal directions. Journal of Visual Languages and Computing, 9, 23-44.
57. Manna, Z., & Pnueli, A. (1992). The Temporal Logic of Reactive and Concurrent Systems. Springer.
58. McKinsey, J. (1941). A solution of the decision problem for the Lewis systems S2 and S4, with an application to topology. Journal of Symbolic Logic, 6, 117-134.
59. McKinsey, J., & Tarski, A. (1944). The algebra of topology. Annals of Mathematics, 45, 141-191.
60. Muller, P. (1998a). A qualitative theory of motion based on spatio-temporal primitives. In Cohn, A., Schubert, L., &: Shapiro, S. (Eds.), Proceedings of the 6th International Conference on Principles of Knowledge Representation and Reasoning (KR'98), pp. 131-142. Morgan Kaufmann.
61. Muller, P. (1998b). Space-time as a primitive for space and motion. In Guarino, N. (Ed.), Proceedings of the International Conference on Formal Ontology in Information Systems (FOIS'98), Vol. 46 of Frontiers in Artificial Intelligence and Applications, pp. 63-76. IOS Press.
62. Nebel, B., & Bürckert, H. (1995). Reasoning about relations: A maximal tractable subclass of Allen's interval algebra. Journal of the ACM, 42, 43-66.
63. Nebel, B. (1996). Artificial intelligence: A computational perspective. In Brewka, G. (Ed.), Principles of Knowledge Representation, pp. 237-266. CSLI Publications.
64. Nutt, W. (1999). On the translation of qualitative spatial reasoning problems into modal logics. In Burgard, W., Christaller, T., & Cremers, A. (Eds.), Advances in Artificial Intelligence. Proceedings of the 23rd Annual German Conference on Artificial Intelligence (KI'99), Vol. 1701 of Lecture Notes in Computer Science, pp. 113-124. Springer.
65. Ono, H., & Nakamura, A. (1980). On the size of refutation Kripke models for some linear modal and tense logics. Studia Logica, 39, 325-333.
66. Orlov, I. (1928). The calculus of compatibility of propositions. Mathematics of the USSR, Sbornik, 35, 26, 3-286. (In Russian).
67. Post, E. (1946). A variant of a recursively unsolvable problem. Bulletin of the AMS, 52, 264-268.
68. Pratt-Hartmann, I. (2002). A topological constraint language with component counting. Journal of Applied Non-Classical Logics, 12, 441-467.
69. Randell, D., Cui, Z., & Cohn, A. (1992). A spatial logic based on regions and connection. In Nebel, B., Rich, C., & Swartout, W. (Eds.), Proceedings of the 3rd International Conference on Principles of Knowledge Representation and Reasoning (KR'92), pp. 165-176. Morgan Kaufmann.
70. Renz, J. (1998). A canonical model of the region connection calculus. In Cohn, A., Schubert, L., & Shapiro, S. (Eds.), Proceedings of the 6th International Conference on Principles of Knowledge Representation and Reasoning (KR'98), pp. 330-341. Morgan Kaufmann.
71. Renz, J., & Nebel, B. (1998). Spatial reasoning with topological information. In Freksa, C., Habel, C., & Wender, K. (Eds.), Spatial Cognition - An Interdisciplinary Approach to Representation and Processing of Spatial Knowledge, Vol. 1404 of Lecture Notes in Computer Science, pp. 351-372. Springer.
72. Renz, J., & Nebel, B. (1999). On the complexity of qualitative spatial reasoning. Artificial Intelligence, 108, 69-123.
73. Renz, J. (2002). A canonical model of the region connection calculus. Journal of Applied Non-Classical Logics, 12, 469-494.
74. Renz, J., & Nebel, B. (2001). Efficient methods for qualitative spatial reasoning. Journal of Artificial Intelligence Research, 15, 289-318.
75. Reynolds, M. (2003). The complexity of the temporal logic with 'until' over general linear time. Journal of Computer and System Science, 66, 393-426.
76. Reynolds, M. (2004). The complexity of the temporal logic over the reals. Submitted, available at http://www.csse.uwa.edu.au/~mark/research/Online/CORT. htm.
77. Schwendimann, S. (1998). A new one-pass tableau calculus for PLTL. In de Swart, H. (Ed.), Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX-98), Vol. 1397 of Lecture Notes in Artificial Intelligence, pp. 277-291. Springer.
78. Sistla, A., & Clarke, E. (1985). The complexity of prepositional linear temporal logics. Journal of the Association for Computing Machinery, 32, 733-749.
79. Sistla, A., & German, S. (1987). Reasoning with many processes. In Proceedings of the Second IEEE Symposium on Logic in Computer Science (LICS'87), pp. 138-153. IEEE Computer Society.
80. Slagle, J., Chang, C.-L., & Lee, R. (1969). Completeness theorems for semantic resolution in consequence-finding. In Proceedings of the 1st International Joint Conference on Artificial Intelligence (IJCAI'69), pp. 281-286. William Kaufmann.
81. Smith, T., & Park, K. (1992). An algebraic approach to spatial reasoning. International Journal of Geographical Information Systems, 6, 177-192.
82. Stockmeyer, L. (1974). The Complexity of Decision Problems in Automata Theory and Logic. Ph.D. thesis, MIT.
83. Stockmeyer, L. (1987). Classifying the computational complexity of problems. Journal of Symbolic Logic, 52, 1-43.
84. Stone, M. (1937). Application of the theory of Boolean rings to general topology. Transactions of the AMS, 41, 321-364.
85. Tarski, A. (1938). Der Aussagenkalkül und die Topologie. Fundamenta Mathematicae, 31, 103-134.
86. Tsao Chen, T. (1938). Algebraic postulates and a geometric interpretation of the Lewis calculus of strict implication. Bulletin of the AMS, 44, 737-744.
87. van Benthem, J. (1995). Temporal logic. In Gabbay, D., Hogger, C., & Robinson, J. (Eds.), Handbook of Logic in Artificial Intelligence and Logic Programming, Vol. 4, pp. 241-350. Oxford Scientific Publishers.
88. van Emde Boas, P. (1997). The convenience of tilings. In Sorbi, A. (Ed.), Complexity, Logic and Recursion Theory, Vol. 187 of Lecture Notes in Pure and Applied Mathematics, pp. 331-363. Marcel Dekker Inc.
89. Wolper, P. (1985). The tableau method for temporal logic: An overview. Logique et Analyse, 28, 119-152.
90. Wolter, F. (1996). Properties of tense logics. Mathematical Logic Quarterly, 42, 481-500.
91. Wolter, F., & Zakharyaschev, M. (2000a). Spatial reasoning in RCC-8 with Boolean region terms. In Horn, W. (Ed.), Proceedings of the 14th European Conference on Artificial Intelligence (ECAI 2000), pp. 244-248. IOS Press.
92. Wolter, F., &: Zakharyaschev, M. (2000b). Spatio-temporal representation and reasoning based on RCC-8. In Cohn, A., Giunchiglia, F., & Seltman, B. (Eds.), Proceedings of the 7th Conference on Principles of Knowledge Representation and Reasoning (KR 2000), pp. 3-14. Morgan Kaufmann.
93. Wolter, F., & Zakharyaschev, M. (2002). Qualitative spatio-temporal representation and reasoning: a computational perspective. In Lalcemeyer, G., & Nebel, B. (Eds.), Exploring Artificial Intelligence in the New Millenium, pp. 175-216. Morgan Kaufmann.
94. Zimmermann, K. (1995). Measuring without measures: the delta-calculus. In Frank, A., & Kuhn, W. (Eds.), Proceedings of the 2nd International Conference on Spatial Information Theory (COSIT), Vol. 988 of Lecture Notes in Computer Science, pp. 59-67. Springer.