Combining spatial and temporal logics: Expressiveness vs. complexity

被引：39
|
作者：
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
来源：
JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH | 2005年 / 23卷
关键词：
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
相关论文
共 50 条
  • [21] Space complexity vs. query complexity
    Lachish, Oded
    Newman, Ilan
    Shapira, Asaf
    COMPUTATIONAL COMPLEXITY, 2008, 17 (01) : 70 - 93
  • [22] Space complexity vs. query complexity
    Lachish, Oded
    Newman, Ilan
    Shapira, Asaf
    APPROXIMATION, RANDOMIZATION AND COMBINATORIAL OPTIMIZATION: ALGORITHMS AND TECHNIQUES, 2006, 4110 : 426 - 437
  • [23] Learning complexity vs. communication complexity
    Linial, Nati
    Shraibman, Adi
    TWENTY-THIRD ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 2008, : 53 - 63
  • [24] Space Complexity Vs. Query Complexity
    Oded Lachish
    Ilan Newman
    Asaf Shapira
    computational complexity, 2008, 17 : 70 - 93
  • [25] Computational complexity of hybrid interval temporal logics
    Walega, Przemyslaw Andrzej
    ANNALS OF PURE AND APPLIED LOGIC, 2023, 174 (01)
  • [26] NO NEED TO BE STRICT: ON THE EXPRESSIVENESS OF METRIC TEMPORAL LOGICS WITH (NON-)STRICT OPERATORS
    Furia, Carlo A.
    Rossi, Matteo
    BULLETIN OF THE EUROPEAN ASSOCIATION FOR THEORETICAL COMPUTER SCIENCE, 2007, (92): : 150 - 160
  • [27] Testing for the transferability of a water quality model to areas of similar spatial and temporal scale based on an uncertainty vs. complexity hypothesis
    Lindenschmidt, Karl-Erich
    ECOLOGICAL COMPLEXITY, 2006, 3 (03) : 241 - 252
  • [28] On the Complexity and Expressiveness of Automated Planning Languages Supporting Temporal Reasoning
    Gigante, Nicola
    PROCEEDINGS OF THE TWENTY-SIXTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2017, : 5181 - 5182
  • [29] On the Computational Complexity of Spatial Logics with Connectedness Constraints
    Kontchakov, R.
    Pratt-Hartmann, I.
    Wolter, F.
    Zakharyaschev, M.
    LOGIC FOR PROGRAMMING, ARTIFICIAL INTELLIGENCE, AND REASONING, PROCEEDINGS, 2008, 5330 : 574 - +
  • [30] Fuzzy temporal association rules: combining temporal and quantitative data to increase rule expressiveness
    Carinena, Purificacion
    WILEY INTERDISCIPLINARY REVIEWS-DATA MINING AND KNOWLEDGE DISCOVERY, 2014, 4 (01) : 64 - 70
12345