On the computational complexity of decidable fragments of first-order linear temporal logics | IEEE Conference Publication | IEEE Xplore