A decision procedure and complete axiomatization of finite interval temporal logic with projection

Journal of Logic and Computation

Volumn 13, Issue 2, 2003, Pages 195-239

  Bowman, Howard ^a   Thompson, Simon ^a  

^a UNIVERSITY OF KENT   (United Kingdom)

Author keywords

Chop; Complete axiomatization; Decision procedure; Interval; Normal form; Projection; Tableau; Temporal

Indexed keywords

CONFORMAL MAPPING; FINITE AUTOMATA; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; PROBLEM SOLVING; THEOREM PROVING;

AXIOMATIZATION; FINITE INTERVAL TEMPORAL LOGIC;

FORMAL LOGIC;

EID: 0037390740     PISSN: 0955792X     EISSN: None     Source Type: Journal    
DOI: 10.1093/logcom/13.2.195     Document Type: Article

References (30)

1. H. Barringer, M. Fisher, D. Gabbay, G. Gough, and R. Owens. METATEM: A framework for programming in temporal logic. In volume 430 of Lecture Notes in Artificial Intelligence. Springer-Verlag, Berlin, 1989.
2. J. L. Bell and M. Machover. A Course in Mathematical Logic. North-Holland, Amsterdam, 1977.
3. M. Ben-Ari, Z. Manna, and A. Pnueli. The temporal logic of branching time. In Eighth ACM Symposium on Principles of Programming Languages, pp. 164-176. ACM, New York, 1981.
4. H. Bowman. An interpretation of cognitive theory in concurrency theory (long version). Technical Report 8-98, Computing Laboratory, University of Kent at Canterbury, 1998. http://www.cs.ukc.ac.uk/pubs/1998/646/index.local.
5. H. Bowman and G. Faconti. Analysing cognitive behaviour using LOTOS and Mexitl. Journal Aspects of Computing, 11, 132-159, 1999.
6. H. Bowman and S. J. Thompson. A tableaux method for interval temporal logic with projection. In TABLEAUX'98, International Conference on Analytic Tableaux and Related Methods, volume 1397 of Lecture Notes in AI, pp. 108-123. Springer-Verlag, Berlin, 1998.
7. H. Bowman, H. Cameron, P. King, and S. Thompson. Specification and prototyping of structured multimedia documents using interval temporal logic. In ICTL'97, International Conference on Temporal Logic, Manchester. Kluwer, Amsterdam, 1997.
8. H. Bowman, H. Cameron, P. King, and S. Thompson. Specification and prototyping of structured multimedia documents using interval temporal logic. Technical Report 3-97 (Kent), Computing Laboratory, University of Kent, 1997.
9. A. Cau and H. Zedan. Retining interval temporal logic specifications. In Fourth AMAST Workshop on Real-Time Systems, Concurrent, and Distributed Softward (ARTS'97), volume 1231 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1997.
10. Z. H. Duan. An Extended Interval Temporal Logic and A Framing Technique for Temporal Logic Programming. PhD thesis, University of Newcastle Upon Tyne, May 1996.
11. B. Dutertre. Complete proof systems for first order interval temporal logic. In volume 10 of Logic in Computer Science, D. Kozen, ed., pp. 36-43. IEEE, Washington, D.C., 1995.
12. E.A. Emerson and J.Y. Halpern. Decision procedures and expressiveness in the temporal logic of branching time. In Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing, pp. 169-180. ACM, New York, 1982.
13. D. Gabbay. The declarative past and imperative future. In Temporal Logic in Specification. B. Banieqbal, H. Barringer, and A. Pnueli, eds, volume 389 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1989.
14. R. Hale. Using temporal logic for prototyping: the design of a lift controller. In Temporal Logic in Specification, Banieqbal et al., eds, pp. 375-408, volume 379 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1989.
15. J. Halpern and Y. Shoham. A Propositional Modal Logic of Time Intervals. Journal of the Association for Computing Machinery, 38, 935-962, 1991.
16. S. Kono. A combination of clausal and non-clausal temporal logic programs. In volume 897 of Lecture Notes in Artificial Intelligence, pp. 4057. Springer-Verlag, Berlin, 1993.
17. S. Kono. Automatic verification of interval temporal logic. Technical Report SCSL-TM-92-007, Sony Computer Science Laboratory, 1992.
18. O. Lichtenstein, A. Pnueli, and I. Zuck. The glory of the past. In Proceedings of Conference on Logics of Programs, volume 193 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1985.
19. Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems. Springer-Verlag, Berlin, 1992.
20. T. Melham. Higher Order Logic and Hardware Verification. Volume 31 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1993.
21. B. Moskowski. Executing Temporal Logic. Cambridge University Press, Cambridge, 1986.
22. B. Moskowski. Some very compositional temporal properties. In Proceedings of Programming Concepts, Methods and Calculi, IFIP Transactions A-56, pp. 307-326. North-Holland, Amsterdam, 1994.
23. B. Moskowski. Using temporal fixpoints to compositionally reason about liveness. In Proceedings of the 7th Refinement Workshop, Electronic Workshops in Computing. Springer-Verlag, Berlin, 1996.
24. Ben Moszkowski. Compositional Reasoning about Projected and Infinite Time. In International Conference on Engineering of Complex Computer Systems (ICECCS'95). IEEE Computer Society Press, Washington, D.C., 1995.
25. B. Paech. Gentzen-systems for propositional temporal logics. In Fourth Proceedings of the 2nd Workshop on Computer Science Logic, volume 385 of Lecture Notes in Computer Science, pp. 240-253. Springer-Verlag, Berlin 1988.
26. N. Rescher and A. Unquart. Temporal Logic. Springer-Verlag, Berlin, 1971.
27. R. Rosner and A. Pnueli. A choppy logic. In Proceedings of First IEEE Symposium on Logic in Computer Science, pp. 306-314, IEEE, Washington, D.C., 1986.
28. S. Thompson. Constructive Interval Temporal Logic in Alf. In ICTL'97, International Conference on Temporal Logic, Manchester. Kluwer, Applied Logic Series, Amsterdam, 1997.
29. Y. Venema. A Modal Logic for Chopping Intervals. Journal of Logic and Computation, 1, 453-476, 1991.
30. P. Wolper. Temporal logic can be more expressive. Information and Computation, 56, 72-99, 1983.