On the computational complexity of decidable fragments of first-order linear temporal logics

Hodkinson, I. and Kontchakov, R. and Kurucz, A. and Wolter, F. and Zakharyaschev, M. (2003) On the computational complexity of decidable fragments of first-order linear temporal logics. In: Proceedings of TIME-ICTL 2003.

Full text not available from this repository.

Item Type:	Conference or Workshop Item (Paper)
Subjects:	UNSPECIFIED
ID Code:	166
Deposited By:	Dr Agi Kurucz
Deposited On:	26 Oct 2007 14:18
Last Modified:	01 Nov 2007 18:22

Repository Staff Only: item control page

Accessibility | Terms and Conditions | Last Modified 01 November 2007