Skip to Main content Skip to Navigation
Journal articles

The Computational Complexity of Hybrid Temporal Logics

Document type :
Journal articles
Complete list of metadata

https://hal.inria.fr/inria-00000304
Contributor : Areces Carlos <>
Submitted on : Friday, September 23, 2005 - 4:41:08 PM
Last modification on : Friday, September 23, 2005 - 4:41:08 PM

Identifiers

  • HAL Id : inria-00000304, version 1

Citation

C. Areces, P. Blackburn, M. Marx. The Computational Complexity of Hybrid Temporal Logics. Logic Journal of the IGPL, Oxford University Press (OUP), 1999, Logic Journal of the IGPL, 8 (5), pp.653--679. ⟨inria-00000304⟩

Share

Metrics

Record views

74