Quantified propositional temporal logic with repeating states

Proceedings of the International Workshop on Temporal Representation and Reasoning

Volumn 2003-January, Issue , 2003, Pages 155-165

  French, Tim ^a  

^a UNIVERSITY OF WESTERN AUSTRALIA   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; FORMAL LOGIC; SEMANTICS;

EXPRESSIVE POWER; EXPRESSIVE SEMANTICS; LINEAR SEQUENCE; LINEAR TEMPORAL LOGIC; PROPOSITIONAL VARIABLES; SATISFIABILITY PROBLEMS; SEMANTIC INTERPRETATION;

TEMPORAL LOGIC;

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

References (15)

1. C. Areces, P. Blackburn, and M. Marx. The computational complexity of hybrid temporal logics. L.J. of the IGPL, 8(5):653-679, 2000.
2. R. Berger. The undecidability of the dominoe problem. Mem. Amer. Math. Soc., 66, 1966.
3. K. Englehardt, R. van der Meyden, and Y. Moses. Knowledge and the logic of local propositions. In Theoretical Aspects of Rationality and Knowledge, Proceedings of the Seventh Conference, pages 29-41, 1998.
4. K. Fine. Propositional quantifiers in modal logic. Theoria, 36:336-346, 1970.
5. T. French. Decidability of quantified propositional branching time logics. In Proceedings of the 14th Australian Joint Conference on Artificial Intelligence, pages 165-176, 2001.
6. T. French and M. Reynolds. A sound and complete proof system for qptl. In Proceedings of AiML 2002, to appear.
7. V. Goranko. Hierarchies of modal and temporal logics with reference pointers. Journal of Logic Language and Information, 5(1):1-24, 1996.
8. D. Harel. Recurring dominoes: making the highly undecidable highly understandable. In Proc. of the Conference on Foundations of Computing Theory, pages 177-194, 1983.
9. D. Harel. Effective transformations on infinite trees, with applications to high undecidability, dominoes, and fairness. Journal A.C.M., 33(1):224-248, 1986.
10. Y. Kesten and A. Pnueli. A complete proof systems for QPTL. In Proceedings, Tenth Annual IEEE Symposium on Logic in Computer Science, pages 2-12, 1995.
11. M. Marx and M. Reynolds. Undecidability of compass logic. Journal of Logic and Computation, 9(6):897-914, 1999.
12. A. Pnueli. The temporal logic of programs. In Proceedings of the Eighteenth Symposium on Foundations of Computer Science, pages 46-57, 1977.
13. A. Sistla, M. Vardi, and P. Wolper. The complementation problem for Buchi automata with applications to temporal logic. Theoretical Computer Science, 49:217-237, 1987.
14. A. P. Sistla. Theoretical Issues in the Design and Verification of Distributed Systems. PhD thesis, Harvard University, 1983.
15. E. Spaan. Complexity of Modal Logics. PhD thesis, Universiteit van Amsterdam, 1993.