On the computational complexity of decidable fragments of first-order linear temporal logics

Proceedings of the International Workshop on Temporal Representation and Reasoning

Volumn 2003-January, Issue , 2003, Pages 91-98

  Hodkinson, Ian ^a   Kontchakov, Roman ^b   Kurucz, Agi ^b   Wolter, Frank ^c   Zakharyaschev, Michael ^b  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

^b KING'S COLLEGE LONDON   (United Kingdom)

^c UNIVERSITY OF LIVERPOOL   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC;

FIRST-ORDER TEMPORAL LOGIC; LINEAR ORDER; LINEAR TEMPORAL LOGIC; LOWER BOUNDS; MONODIC FRAGMENTS; NATURAL NUMBER; TEMPORAL OPERATORS; VARIABLE FRAGMENT;

TEMPORAL LOGIC;

EID: 84944046199     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/TIME.2003.1214884     Document Type: Conference Paper

References (26)

1. R. Alur and T.A. Henzinger. A really temporal logic. Journal of the ACM, 41:181-204, 1994.
2. A. Artale, E. Franconi, F. Wolter, and M. Zakharyaschev. A temporal description logic for reasoning about conceptual schemas and queries. In S. Flesca, S. Greco, N. Leone, and G. Ianni, editors, Proceedings of JELIA'02, volume 2424 of Lecture Notes in Computer Science, pages 98-110. Springer, 2002.
3. E. Börger, E. Grädel, and Yu. Gurevich. The Classical Decision Problem. Perspectives in Mathematical Logic. Springer, 1997.
4. A. Chandra, D. Kozen, and L. Stockmeyer. Alternation. Journal of the ACM, 28:114-133, 1981.
5. P. van Emde Boas. The convenience of tilings. In A. Sorbi, editor, Complexity, Logic and Recursion Theory, volume 187 of Lecture Notes in Pure and Applied Mathematics, pages 331-363. Marcel Dekker Inc., 1997.
6. D. Gabbay, A. Kurucz, F. Wolter, and M. Zakharyaschev. Many-Dimensional Modal Logics: Theory and Applications. Studies in Logic. Elsevier, 2003. To appear.
7. D. Gabbay and V. Shehtman. Products of modal logics. Part I. Journal of the IGPL, 6:73-146, 1998.
8. E. Grädel. On the restraining power of guards. Journal of Symbolic Logic, 64:1719-1742, 1999.
9. E. Grädel. Decision procedures for guarded logics. In Automated Deduction - CADE16, volume 1632 of LNCS, pages 31-51. Springer-Verlag, 1999. Proceedings of 16th International Conference on Automated Deduction, Trento, 1999.
10. J. Halpern and M. Vardi. The complexity of reasoning about knowledge and time I: lower bounds. Journal of Computer and System Sciencees, 38:195-237, 1989.
11. I. Hodkinson, F. Wolter, and M. Zakharyaschev. Decidable fragments of first-order temporal logics. Annals of Pure and Applied Logic, 106:85-134, 2000.
12. L. Lamport. What good is temporal logic? In R. E. A. Mason, editor, Information Processing 83, pages 657-668. Elsevier Publishers, 1983.
13. M. Marx. Tolerance logic. J. Logic, Language and Information, 10:353-373, 2001.
14. M. Marx and M. Reynolds. Undecidability of compass logic. J. Logic Computat., 9:897-914, 1999.
15. H. Ono and A. Nakamura. On the size of refutation Kripke models for some linear modal and tense logics. Studia Logica, 39:325-333, 1980.
16. M. Reynolds. A decidable temporal logic of parallelism. Notre Dame Journal of Formal Logic, 38:419-436, 1997.
17. M. Reynolds. The complexity of the temporal logic over the reals, 1999. Submitted.
18. M. Reynolds. The complexity of the temporal logic with until over general linear time. Journal of Computer and System Science, 2002. To appear.
19. M. Reynolds and M. Zakharyaschev. On the products of linear modal logics. J. Logic Computat., 11:909-931, 2001.
20. W. Savitch. Relationship between nondeterministic and deterministic tape classes. Journal of Computer and System Sciences, 4:177-192, 1970.
21. K. Schild. Combining terminological logics with tense logic. In Proceedings of the 6th Portuguese Conference on Artificial Intelligence, pages 105-120, Porto, 1993.
22. A. Sistla and E. Clarke. The complexity of propositional linear temporal logics. Journal of the Association for Computing Machinery, 32:733-749, 1985.
23. A. Sistla and S. German. Reasoning with many processes. In Proceedings of the Second IEEE Symposium on Logic in Computer Science, pages 138-153, 1987.
24. A. Sistla and L. Zuck. On the eventuality operator in temporal logic. In Proceedings of the Second IEEE Symposion on Logic in Computer Science (LICS'87), pages 153-166. IEEE Computer Society, 1987.
25. F. Wolter. Properties of tense logics. Mathematical Logic Quarterly, 42:481-500, 1996.
26. F. Wolter and M. Zakharyaschev. Temporalizing description logics. In D. Gabbay and M. de Rijke, editors, Frontiers of Combining Systems II, pages 379-401. Studies Press/Wiley, 2000.