Abstract
First-order temporal logic, the extension of first-order logic with operators dealing with time, is a powerful and expressive formalism with many potential applications. This expressive logic can be viewed as a framework in which to investigate problems specified in other logics. The monodic fragment of first-order temporal logic is a useful fragment that possesses good computational properties such as completeness and sometimes even decidability. Temporal logics of knowledge are useful for dealing with situations where the knowledge of agents in a system is involved. In this paper we present a translation from temporal logics of knowledge into the monodic fragment of first-order temporal logic. We can then use a theorem prover for monodic first-order temporal logic to prove properties of the translated formulas. This allows problems specified in temporal logics of knowledge to be verified automatically without needing a specialized theorem prover for temporal logics of knowledge. We present the translation, its correctness, and examples of its use.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Artale, A. and Franconi, E. (1999) Introducing temporal description logics, in C. Dixon and M. Fisher (eds.), Proceedings of the 6th International Workshop on Temporal Representation and Reasoning (TIME-99), IEEE Computer Society Press, Orlando, FL.
Chomicki, J. and Niwinski, D. (1995) On the feasibility of checking temporal integrity constraints, J. Comput. System Sci. 51(3), 523–535.
Cluedo. http://www.hasbro.com.
Degtyarev, A., Fisher, M. and Konev, B. (in press) Monodic temporal resolution, ACM Trans. Computational Logic. A preliminary version available as Technical Report ULCS-03-001, The University of Liverpool, 2003, http://www.csc.liv.ac.uk/research
Degtyarev, A., Fisher, M. and Konev, B. (2003) Handling equality in monodic temporal resolution, in Proceedings of 10th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR), Lecture Notes in Comput. Sci. 2850, Springer, Almaty, Kazakhstan, pp. 214–228.
de Nivelle, H. (2000) An overview of resolution decision procedures, in M. Faller, S. Kaufmann and M. Pauly (eds.), Formalizing the Dynamics of Information, CSLI Publications 91, Stanford University, Palo Alto, CA, pp. 115–130.
Dixon, C. (2005) Using temporal logics of knowledge for specification and verification – a case study, Journal of Applied Logic, Elsevier Science, to appear.
Dixon, C., Fernández-Gago, M. C., Fisher, M. and van der Hoek, W. (2003) Using temporal logics of knowledge in the formal verification of security protocols, Technical Report ULCS-03-022, http://www.csc.liv.ac.uk/research/techreports
Dixon, C., Fernández-Gago, M. C., Fisher, M. and van der Hoek, W. (2004) Using temporal logics of knowledge in the formal verification of security protocols, in Proceedings of TIME2004, IEEE, Computer Society Press.
Dixon, C., Fisher, M. and Wooldridge, M. (1998) Resolution for temporal logics of knowledge, J. Logic Comput. 8(3), 345–372.
Emerson, E. A. (1990) Temporal and modal logic, in J. van Leeuwen (ed.), Handbook of Theoretical Computer Science, Elsevier, pp. 996–1072.
Fagin, R., Halpern, J. Y., Moses, Y. and Vardi, M. Y. (1995) Reasoning about Knowledge, MIT Press.
Fisher, M. (1997) A normal form for temporal logic and its application in theorem-proving and execution, J. Logic Comput. 7(4), 429–456.
Fisher, M., Dixon, C. and Peim, P. (2001) Clausal temporal resolution, Trans. Comput. Logic 2(1), 12–56.
Fisher, M. and Wooldridge, M. (1997) On the formal specification and verification of multi-agent systems, Internat. J. Cooperative Information Systems 6(1), 37–65.
Gabbay, D., Kurusz, A., Wolter, F. and Zakharyaschev, M. (2003) Many-Dimensional Modal Logics: Theory and Applications, Elsevier.
Gabelaia, D., Kontchakov, R., Kurucz, A., Wolter, F. and Zakharyaschev, M. (2003) On the computational complexity of spatio-temporal logics, in Proceedings of the 16th International Florida Artificial Intelligence Research Symposium Conference (FLAIRS 2003), AAAI press, 460–464.
Grädel, E. (1999) On the restraining power of guards, J. Symbolic Logic 64, 1719–1742.
Halpern, J. Y. (1987) Using reasoning about knowledge to analyze distributed systems, Annual Rev. Comput. Sci. 2, 37–68.
Halpern, J. Y. and Vardi, M. Y. (1989) The Complexity of Reasoning about Knowledge and Time. I Lower Bounds, J. Comput. System Sci. 38, 195–237.
Hodkinson, I. (2000) Monodic packed fragment with equality is decidable, Studia Logica 72, 185–197.
Hodkinson, I., Wolter, F. and Zakharyaschev, M. (2000) Decidable fragments of first-order temporal logic, Ann. Pure Appl. Logic 106, 85–134.
Hustadt, U., Konev, B., Riazanov, A. and Voronkov, A. (2004) TeMP: A temporal monodic prover, Technical Report 04-004, ULCS. http://www.csc.liv.ac.uk/research
Hustadt, U. and Schmidt, R. A. (2001) Formulae which highlight differences between temporal logic and dynamic logic provers, in E. Giunchiglia and F. Massacci (eds.), Issues in the Design and Experimental Evaluation of Systems for Modal and Temporal Logics, Dipartimento di Ingegneria dell'Informazione, Unversitá degli Studi di Siena, Siena, Italy, pp. 68–76.
Konev, B., Degtyarev, A., Dixon, C., Fisher, M. and Hustadt, U. (2003) Towards the implementation of first-order temporal resolution: The expanding domain case, in Proceedings of the 10th International Symposium on Temporal Representation and Reasoning (TIME-ICTL).
Konev, B., Degtyarev, A., Dixon, C., Fisher, M. and Hustadt, U. (2005, to appear) Mechanizing first-order temporal resolution, Inform. and Comput., Elsevier Science.
Manna, Z. and Pnueli, A. (1992) The Temporal Logic of Reactive and Concurrent Systems: Specification, Springer, New York.
Meyer, J. J. C. and van der Hoek, W. (1995) Epistemic Logic for Computer Science and Artificial Intelligence, Cambridge Tracts Theoret. Comput. Sci. 41.
Needham, R. and Schroeder, M. (1978) Using encryption for authentication in large networks of computers, Comm. ACM 21, 993–999.
Plaisted, D. A. and Greenbaum, S. A. (1986) A structure-preserving clause form translation, J. Symbolic Comput. 2(3), 293–304.
Riazanov, A. and Voronkov, A. (2002) The design and implementation of Vampire, Artificial Intelligence Commun. 15(2–3), 91–110.
Schmidt, R. A. and Hustadt, U. (2003) A principle for incorporating axioms into the first-order translation of modal formulae, in Automated Deduction – CADE-19, Lecture Notes in Artificial Intelligence, 2741, Springer, pp. 412–426.
Syverson, P. (1993) Adding time to a logic of authentication, in Proceedings of the 1st ACM Conference on Computer and Communications Security, ACM Press, pp. 97–101.
Voronkov, A. (1995) The anatomy of Vampire, J. Automat. Reason. 15(2), 237–265.
Author information
Authors and Affiliations
Corresponding author
Additional information
Partially supported by EPSRC project: Analysis and Mechanisation of Decidable First-Order Temporal Logics (GR/R45376/01).
Rights and permissions
About this article
Cite this article
Fernández-Gago, M.C., Hustadt, U., Dixon, C. et al. First-Order Temporal Verification in Practice. J Autom Reasoning 34, 295–321 (2005). https://doi.org/10.1007/s10817-005-7354-1
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10817-005-7354-1