On the Computational Complexity of Decidable Fragments of First-Order Linear Temporal Logics

From Tetherless World Wiki

\begin{bibtex} @inproceedings{DBLP:conf/time/HodkinsonKKWZ03,

 author    = {Ian M. Hodkinson and
              Roman Kontchakov and
              Agi Kurucz and
              Frank Wolter and
              Michael Zakharyaschev},
 title     = {On the Computational Complexity of Decidable Fragments of
              First-Order Linear Temporal Logics},
 booktitle = {TIME},
 year      = {2003},
 pages     = {91-98},
 ee        = {http://csdl.computer.org/comp/proceedings/time-ictl/2003/1912/00/19120091abs.htm},
 crossref  = {DBLP:conf/time/2003},
 bibsource = {DBLP, http://dblp.uni-trier.de}

}

\end{bibtex}