![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Agi Kurucz David Gabelaia , Roman Kontchakov , Agi Kurucz, Frank Wolter , Michael Zakharyaschev : On the Computational Complexity of Spatio-Temporal Logics. FLAIRS Conference 2003 : 460-464 Ian M. Hodkinson , Roman Kontchakov , Agi Kurucz, Frank Wolter , Michael Zakharyaschev : On the Computational Complexity of Decidable Fragments of First-Order Linear Temporal Logics. TIME 2003 : 91-98 1 [ 2 ] 2 [ 1 ] 3 [ 1 ] [ 2 ] 4 [ 1 ] [ 2 ] 5 [ 1 ] [ 2 ] ![]() ©2004 Association for Computing Machinery |