Combining spatial and temporal logics: Expressiveness vs. complexity

被引:40
作者
Gabelaia, D [1 ]
Kontchakov, R
Kurucz, A
Wolter, F
Zakharyaschev, M
机构
[1] Kings Coll London, Dept Comp Sci, London WC2R 2LS, England
[2] Univ Liverpool, Dept Comp Sci, Liverpool L69 7ZF, Merseyside, England
关键词
D O I
10.1613/jair.1537
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper, we construct and investigate a hierarchy of spatio-temporal formalisms that result from various combinations of propositional spatial and temporal logics such as the propositional temporal logic PTL, the spatial logics RCC-8, BRCC-8, S4u and their fragments. The obtained results give a clear picture of the trade-off between expressiveness and 'computational realisability' within the hierarchy. We demonstrate how different combining principles as well as spatial and temporal primitives can produce NP-, PSPACE-, EXPSPACE-, 2EXPSPACE-complete, and even undecidable spatio-temporal logics out of components that are at most NP- or PSPACE-complete.
引用
收藏
页码:167 / 243
页数:77
相关论文
共 94 条
[1]  
Aiello M., 2002, J APPL NONCLASSICAL, V12, P319
[2]  
Alexandroff P., 1937, Mat. Sb., V2, P501
[3]   MAINTAINING KNOWLEDGE ABOUT TEMPORAL INTERVALS [J].
ALLEN, JF .
COMMUNICATIONS OF THE ACM, 1983, 26 (11) :832-843
[4]  
[Anonymous], 1928, MAT SBORNIK
[5]  
[Anonymous], 1966, GEN TOPOLOGY 1
[6]  
[Anonymous], 1985, LOGIQUE ANAL
[7]  
ARECES C, 2000, LOG J IGPL, V8, P653
[8]   ON SUBMAXIMAL SPACES [J].
ARHANGELSKII, AV ;
COLLINS, PJ .
TOPOLOGY AND ITS APPLICATIONS, 1995, 64 (03) :219-241
[9]  
Asher N, 1995, INT JOINT CONF ARTIF, P846
[10]  
Balbiani P, 2002, LECT NOTES ARTIF INT, V2309, P162