top

The Computational Complexity of Hybrid Temporal Logics

C. Areces, P. Blackburn, and M. Marx. The Computational Complexity of Hybrid Temporal Logics. Logic Journal of the IGPL, 8(5):653–679, 2000.

Download: [pdf] 

Abstract:

(unavailable)

BibTeX: (download)

@ARTICLE{areces00:_comput_compl_hybrid_tempor_logic,
  author = {C. Areces and P. Blackburn and M. Marx},
  title = {The Computational Complexity of Hybrid Temporal Logics},
  journal = {Logic Journal of the IGPL},
  year = {2000},
  volume = {8},
  pages = {653--679},
  number = {5},
}

Generated by bib2html.pl (written by Patrick Riley ) on Mon Aug 10, 2009 14:52:33