On non-local propositional and local one-variable quantified CTL∗

Proceedings of the International Workshop on Temporal Representation and Reasoning

Volumn 2002-January, Issue , 2002, Pages 2-9

  Bauer, S ^a   Hodkinson, I ^b   Wolter, F ^a   Zakharyaschev, M ^c  

^a UNIVERSITY OF LEIPZIG   (Germany)

^b IMPERIAL COLLEGE LONDON   (United Kingdom)

^c KING'S COLLEGE LONDON   (United Kingdom)

Author keywords

Calculus; Computer science; Educational institutions; Embedded computing; Instruments; Logic; Spatiotemporal phenomena

Indexed keywords

CALCULATIONS; COMPUTABILITY AND DECIDABILITY; COMPUTATION THEORY; COMPUTER SCIENCE; INSTRUMENTS;

CALCULUS; EDUCATIONAL INSTITUTIONS; EMBEDDED COMPUTING; LOGIC; SPATIOTEMPORAL PHENOMENA;

TEMPORAL LOGIC;

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

References (10)

1. J. Burgess. Logic and time. Journal of Symbolic Logic, 44:566-582, 1979.
2. A. Chandra, J. Halpern, A. Meyer, and R. Parikh. Equations between regular terms and an application to process logic. In STOC, pages 384-390, 1981.
3. E. Emerson and J. Halpern. "sometimes" and "not never" revisited: on branching versus linear time. Journal of the ACM, 33:151-178, 1986.
4. I. Hodkinson, F. Wolter, and M. Zakharyaschev. Decidable fragments of first-order temporal logics. Annals of Pure and Applied Logic, 106:85-134, 2000.
5. I. Hodkinson, F. Wolter, and M. Zakharyaschev. Monodic fragments of first-order temporal logics: 2000-2001 a.d. In R. Nieuwenhuis and A. Voronkov, editors, Logic for Programming, Artificial Intelligence and Reasoning, volume 2250 of LNAI, pages 1-23. Springer-Verlag, 2001.
6. I. Hodkinson, F. Wolter, and M. Zakharyaschev. Decidable and undecidable fragments of first-order branching temporal logics. In Proc. Logic in Computer Science (LICS'02). IEEE Computer Science Press, 2002 (in print). (Draft available at http://www.dcs.kcl.ac.uk/staff/mz.)
7. F. Laroussinie and P. Schnoebelen. A hierarchy of temporal logics with past. Volume 775 of LNCS, pages 47-58. Springer-Verlag, 1994.
8. M. O. Rabin. Decidability of second order theories and automata on infinite trees. Transactions of the American Mathematical Society, 141:1-35, 1969.
9. F. Wolter and M. Zakharyaschev. Qualitative spatio-temporal representation and reasoning: a computational perspective. In Exploring Artificial Intelligence in the New Millenium. Morgan Kaufmann Publishers, 2002 (in print).
10. A. Zanardo. A finite axiomatization of the set of strongly valid ockamist formulas. Journal of Philosophical Logic, 14:447-468, 1985.