Abstract
First-Order Temporal Logic, FOTL, is an extension of classical first-order logic by temporal operators for a discrete linear model of time (isomorphic to ℕ, that is, the most commonly used model of time). Formulae of this logic are interpreted over structures that associate with each element n of ℕ, representing a moment in time, a first-order structure (D n ,I n ) with its own non-empty domain D n . In this paper we make the expanding domain assumption, that is, D n ⊆ D m if n<m. The set of valid formulae of this logic is not recursively enumerable. However, the set of valid monodic formulae is known to be finitely axiomatisable [13].
Work supported by EPSRC grant GR/L87491.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Artale, A., Franconi, E., Wolter, F., Zakharyaschev, M.: A temporal description logic for reasoning over conceptual schemas and queries. In: Flesca, S., Greco, S., Leone, N., Ianni, G. (eds.) JELIA 2002. LNCS (LNAI), vol. 2424, pp. 98–110. Springer, Heidelberg (2002)
Bachmair, L., Ganzinger, H.: Resolution theorem proving. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, pp. 19–99. Elsevier, Amsterdam (2001)
Fisher, M., Dixon, C., Peim, M.: Clausal temporal resolution. ACM Transactions on Computational Logic 2(1), 12–56 (2001)
Fisher, M., Lisitsa, A.: Temporal verification of monodic abstract state machines. Technical Report ULCS-03-011, Department of Computer Science, University of Liverpool (2003)
Gabelaia, D., Kontchakov, R., Kurucz, A., Wolter, F., Zakharyaschev, M.: On the computational complexity of spatio-temporal logics. In: Proc. FLAIRS 2003, pp. 460–464. AAAI Press, Menlo Park (2003)
Hustadt, U., Konev, B.: TRP++ 2.0: A temporal resolution prover. In: Baader, F. (ed.) CADE 2003. LNCS(LNAI), vol. 2741, pp. 274–278. Springer, Heidelberg (2003)
Hustadt, U., Schmidt, R.A.: Scientific benchmarking with temporal logic decision procedures. In: Proc. KR 2002, pp. 533–544. Morgan Kaufmann, San Francisco (2002)
Janssen, G.: Logics for Digital Circuit Verification: Theory, Algorithms, and Applications. PhD thesis, Eindhoven University of Technology, The Netherlands (1999)
Konev, B., Degtyarev, A., Dixon, C., Fisher, M., Hustadt, U.: Mechanising first-order temporal resolution. Technical Report ULCS-03-023, University of Liverpool, Department of Computer Science (2003), http://www.csc.liv.ac.uk/research/
Kontchakov, R., Lutz, C., Wolter, F., Zakharyaschev, M.: Temporalising tableaux. Studia Logica 76(1), 91–134 (2004)
Riazanov, A., Voronkov, A.: The design and implementation of Vampire. AI Communications 15(2-3), 91–110 (2002)
Schwendimann, S.: Aspects of Computational Logic. PhD thesis, Universität Bern, Switzerland (1998)
Wolter, F., Zakharyaschev, M.: Axiomatizing the monodic fragment of first-order temporal logic. Annals of Pure and Applied logic 118, 133–145 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hustadt, U., Konev, B., Riazanov, A., Voronkov, A. (2004). TeMP: A Temporal Monodic Prover. In: Basin, D., Rusinowitch, M. (eds) Automated Reasoning. IJCAR 2004. Lecture Notes in Computer Science(), vol 3097. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25984-8_23
Download citation
DOI: https://doi.org/10.1007/978-3-540-25984-8_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22345-0
Online ISBN: 978-3-540-25984-8
eBook Packages: Springer Book Archive