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

Ian M. Hodkinson, Roman Kontchakov, Agi Kurucz, Frank Wolter, Michael Zakharyaschev

Browse the full TIME paper archive.