A clausal resolution method for extended computation tree logic ECTL

Proceedings of the International Workshop on Temporal Representation and Reasoning

Volumn 2003-January, Issue , 2003, Pages 107-117

  Bolotov, Alexander ^a  

^a UNIVERSITY OF WESTMINSTER   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; FORESTRY; FORMAL LOGIC;

CLAUSAL NORMAL FORMS; CLAUSAL RESOLUTIONS; CLOSURE PROPERTY; COMPUTATION TREE LOGIC; CORRECTNESS ARGUMENT; LINEAR TIME TEMPORAL LOGIC; RESOLUTION METHODS; TEMPORAL RESOLUTION;

TEMPORAL LOGIC;

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

References (12)

1. A. Bolotov. Clausal Resolution for Branching-Time Temporal Logic. PhD thesis, Department of Computing and Mathematics, The Manchester Metropolitan University, 2000.
2. A. Bolotov and C. Dixon. Resolution for Branching Time Temporal Logics: Applying the Temporal Resolution Rule. In Proceedings of the 7th International Conference on Temporal Representation and Reasoning (TIME2000), pages 163-172, Cape Breton, Nova Scotia, Canada, 2000. IEEE Computer Society.
3. A. Bolotov and M. Fisher. A Clausal Resolution Method for CTL Branching Time Temporal Logic. Journal of Exper-imental and Theoretical Artificial Intelligence., 11:77-93, 1999.
4. A. Bolotov, M. Fisher, and C. Dixon. On the Relationship between 'w'-automata and Temporal Logic Normal Form. Journal of Logic and Computation, 12:561-581, 2002.
5. J. Bradfield. and C. Stirling. Modal logics and mu-calculi. In J. Bergstra, A. Ponse, and S. Smolka, editors, Handbook of Process Algebra, pages 293-330. Elsevier, North-Holland, 2001.
6. E. M. Clarke and E. A. Emerson. Design and synthesis of synchronisation skeletons using branching time temporal logic. In Logic of Programs. Proceedings of Workshop, volume 131 of Lecture Notes in Computer Science, pages 52-71. Springer, 1981.
7. E. A. Emerson. Temporal and Modal Logic. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science: Volume B, Formal Models and Semantics., pages 996-1072. Elsevier, 1990.
8. E. A. Emerson. Automated reasoning about reactive systems. In Logics for Concurrency: Structures Versus Automata, Proc. of International Workshop, volume 1043 of Lecture Notes in Computer Science, pages 41-101. Springer, 1996.
9. E. A. Emerson and J. Y. Halpern. "Sometimes" and "Not never" revisited: On branching versus linear time temporal logic. JACM, 33(1):151-178, 1986.
10. E. A. Emerson and A. P. Sistla. Deciding full branching time logic. In STOC 1984, Proceedings of, pages 14-24, 1984.
11. M. Fisher. A Resolution Method for Temporal Logic. In Proc. of the XII International Joint Conference on Artificial Intelligence (IJCAI), pages 99-104, 1991.
12. P. Wolper. On the relation of programs and computations to models of temporal logic. In L. Bolc and A. Szalas, editors, Time and Logic, a computational approach, chapter 3, pages 131-178. UCL Press Limited, 1995.