On the Computational Complexity of Decidable Fragments of First-Order Linear Temporal Logics Ian Hodkinson, Roman Kontchakov, Agi Kurucz, Frank Wolter, and Michael Zakharyaschev   View Paper (PDF)   Return to Research Papers ©2004 Association for Computing Machinery