A clausal resolution method for ctl branching-time temporal logic

Journal of Experimental and Theoretical Artificial Intelligence

Volumn 11, Issue 1, 1999, Pages 77-93

  Bolotov, Alexander ^a   Fisher, Michael ^a  

^a MANCHESTER METROPOLITAN UNIVERSITY   (United Kingdom)

Author keywords

Branching time automated deduction resolution program specification verification

Indexed keywords

EID: 0442282930     PISSN: 0952813X     EISSN: 13623079     Source Type: Journal    
DOI: 10.1080/095281399146625     Document Type: Article

References (18)

1. Bolotov, A., and Fisher, M., 1997, A resolution method for CTL branching time temporal logic. IV International Workshop on Temporal Representation and Reasoning (TIME'97) (Los Alamitos: IEEE), pp. 20-27.
2. Clarke, E. M., and Emerson, E. A., 1981, Design and synthesis of synchronisation skeletons using branching time temporal logic. Proceedings of the Workshop on Logic of Programs, Lecture Notes in Computer Science, 131, pp. 52-71.
3. Clarke, E. M, Emerson, E. A., and Sistla A. P., 1986, Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Transactions on Programming Languages and Systems, 8(2): 244-263.
4. Dixon, D., 1995, Strategies for temporal resolution. PhD thesis, Department of Computer Science, University of Manchester, Manchester M13 9PL, UK.
5. Dixon, C., 1996, Search strategies for resolution in temporal logics. Proceedings of the Thirteenth International Conference on Automated Deduction, July 30-August 3 pp. 672-687.
6. Emerson, E. A., 1990, Temporal and modal logic. Handbook of Theoretical Computer Science, edited by J. van Leeuwen (North Holland: Elsevier), pp. 996-1072.
7. Emerson, E. A., 1996, Automated reasoning about reactive systems. Logics for Concurrency: Structures Versus Automata, Lecture Notes in Computer Science, Vol. 1043 (Berlin: Springer-Verlag), pp. 41-92.
8. Emerson, E. A., and Halpern, J. Y., 1982, Decision procedures and expressiveness in the temporal logic of branching time. Proceedings of the Fourteenth ACM Symposium on the Theory of Computing (STOC), San Francisco, May 5-7 pp. 169-180.
9. Emerson, E. A., and Halpern, J. Y., 1982, "Sometimes" and "Not Never" revisited: on branching versus linear time temporal logic. ACM Journal, 33(1): 151-178.
10. Emerson, E. A., and Lee, C. L., 1985, Modalities for model checking: branching time logic strikes back. Science of Computer Programming, 8: 275-306.
11. Emerson, E. A., and Sistla, A. P., 1984, Deciding full branching time logic. Information and Control, 61(3): 175-201.
12. Fisher, M., 1991, A resolution method for temporal logic. Proceedings of the Twelfth International Joint Conference on Artificial Intelligence (IJCAI), Sydney, Australia, August pp. 99-104.
13. Fisher, M., 1997, A normal form for temporal logic and its application in theorem-proving and execution. Journal of Logic and Computation, 7(4): 429-456.
14. Genesereth, M. R., and Nillson, J., 1988, Logical Foundations of Artificial Intelligence (Los Altos: Morgan Kaufmann Publishers).
15. Pnueli, A., 1977, The temporal logic of programs. Proceedings of the Eighteenth Symposium on the Foundations of Computer Science, Providence, USA, October 31-November 2 pp. 46-57.
16. Prior, A., 1967, Past, Present and Future. (Oxford: Oxford University Press).
17. Rao, A. S., and Georgeff, M. P., 1991, Modeling rational agents within a BDI-architecture. International Conference on Principles of Knowledge Representation and Reasoning (KR), Cambridge, Massachusetts April 22-25 pp. 473-484.
18. Vardi, M. Y., 1996, An automata-theoretic approach to linear temporal logic. Logics for Concurrency: Structures Versus Automata, Lecture Notes in Computer Science, Vol. 1043 (Berlin: Springer-Verlag), pp. 238-266.