Resolution for branching time temporal logics: Applying the temporal resolution rule

Proceedings of the International Workshop on Temporal Representation and Reasoning

Volumn 2000-January, Issue , 2000, Pages 163-172

  Bolotov, Alexander ^a   Dixon, Clare ^a  

^a MANCHESTER METROPOLITAN UNIVERSITY   (United Kingdom)

Author keywords

Automata; Concurrent computing; Detection algorithms; DH HEMTs; Logic; Mathematics; Power system modeling

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; FORMAL LOGIC; MATHEMATICAL TECHNIQUES;

AUTOMATA; CONCURRENT COMPUTING; DETECTION ALGORITHM; DH-HEMTS; LOGIC; POWER SYSTEM MODEL;

TEMPORAL LOGIC;

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

References (15)

1. O. Bernholtz, M. Vardi, and P. Wolper. An automatatheoretic approach to branching-time model checking. In Computer Aided Verification. Proceedings of 6th International Workshop, volume 818 of Lecture Notes in Computer Science. Springer-Verlag, 1994.
2. A. Bolotov. Clausal Resolution for Branching-Time Temporal Logic. PhD thesis, The Manchester Metropolitan University, 1999, (submitted).
3. A. Bolotov and M. Fisher. A clausal resolution method for ctl branching time temporal logic. Journal of experimental and theoretical artificial intelligence, (11):77-93, 1999.
4. E. M. Clarke and E. A. Emers on. Using Branching Time Temporal Logic to Synthesise Synchronisation Skeletons. Science of Computer Programming, pages 241-266, 1982.
5. C. Dixon. Search Strategies for Resolution in Temporal Logics. In M. A. M cRobbie and J. K. Slaney, editors, Proceedings of the Thirteenth International Conference on Automated Deduction (CADE), volume 1104 of Lecture Notes in Artificial Intelligence, pages 672-687, New Brunswick, New Jersey, July/August 19 96. Springer-Verlag.
6. C. Dixon. Temporal resolution using a breadth-first search algorithm Annals of Mathematics and Artificial Intelligence 22 1998.
7. C. Dixon andM. Fisher. The Set of Support Strategy in Temporal Resolution. In Proceedings of TIME-98 the Fifth International Workshop on Temporal Representation and Reasoning, Sanibel Island, Florida, May 1998. IEEE Computer Society Press.
8. 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.
9. 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. Springer-Verlag, 1996.
10. M. Fisher. A Resolution Method for Temporal Logic. In Proc. of the XII International Joint Conference on Artificial Intelligence (IJCAI), 1991.
11. D. Gabbay, A. Phueli, S. Shelah, and J. Stavi. On the temporal analysis of fairness. In Proceedings of 7th ACM Symposium on Principles of Programming Languages, 1980.
12. H.-J. Ohlbach. A Resolution Calculus for Modal Logics. Lecture Notes in Computer Science, 310:500-516, May 1988.
13. A. Pnueli. The Temporal Logic of Programs. In Proc. of the Eighteenth Symposium on the Foundations of Computer Science, 1977.
14. L. A. Wallen. Matrix Proof Methods for Modal Logics. In Proc. IJCAI-87, pages 917-923, Milan, Aug. 1987.
15. L. Wos, G. Robinson, and D. Carson. Efficiency and Completeness of the Set of Support Strategy in Theorem Proving. J. ACM, 12:536-541, Oct. 1965.