The Complexity of Reasoning with Relative Directions

被引：3
|
作者：
Lee, Jae Hee [1 ]
机构：
[1] Univ Bremen, D-28359 Bremen, Germany
来源：
21ST EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE (ECAI 2014) | 2014年 / 263卷
关键词：
D O I：
10.3233/978-1-61499-419-0-507
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
Whether reasoning with relative directions can be performed in NP has been an open problem in qualitative spatial reasoning. Efficient reasoning with relative directions is essential, for example, in rule-compliant agent navigation. In this paper, we prove that reasoning with relative directions is there exists R-complete. As a consequence, reasoning with relative directions is not in NP, unless NP = there exists R.
引用
收藏
页码：507 / 512
页数：6
相关论文
共 50 条
  • [41] Counting Complexity for Reasoning in Abstract Argumentation
    Fichte, Johannes K.
    Hecher, Markus
    Meier, Arne
    THIRTY-THIRD AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE / THIRTY-FIRST INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE / NINTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2019, : 2827 - 2834
  • [42] Taming the Complexity of Temporal Epistemic Reasoning
    Dixon, Clare
    Fisher, Michael
    Konev, Boris
    FRONTIERS OF COMBINING SYSTEMS, PROCEEDINGS, 2009, 5749 : 198 - 213
  • [43] The Complexity of Reasoning about Spatial Congruence
    Dipto. Scientifico e Tecnologico, Università di Verona, Cà Vignal 2, strada Le Grazie, I-37134 Verona, Italy
    J Artif Intell Res, 0 (361-390):
  • [44] Nonmonotonic reasoning: from complexity to algorithms
    C. Cayrol
    M.‐C. Lagasquie‐Schiex
    T. Schiex
    Annals of Mathematics and Artificial Intelligence, 1998, 22 : 207 - 236
  • [45] Nonmonotonic reasoning: from complexity to algorithms
    Cayrol, C
    Lagasquie-Schiex, MC
    Schiex, T
    ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 1998, 22 (3-4) : 207 - 236
  • [46] Complexity of Reasoning With Expressive Ontology Mappings
    Ghidini, Chiara
    Serafini, Luciano
    Tessaris, Sergio
    FORMAL ONTOLOGY IN INFORMATION SYSTEMS, 2008, 183 : 151 - +
  • [47] The Complexity of Reasoning for Fragments of Default Logic
    Beyersdorff, Olaf
    Meier, Arne
    Thomas, Michael
    Vollmer, Heribert
    THEORY AND APPLICATIONS OF SATISFIABILITY TESTING - SAT 2009, PROCEEDINGS, 2009, 5584 : 51 - 64
  • [48] The complexity of reasoning for fragments of default logic
    Beyersdorff, Olaf
    Meier, Arne
    Thomas, Michael
    Vollmer, Heribert
    JOURNAL OF LOGIC AND COMPUTATION, 2012, 22 (03) : 587 - 604
  • [49] Proof Complexity of Symbolic QBF Reasoning
    Mengel, Stefan
    Slivovsky, Friedrich
    THEORY AND APPLICATIONS OF SATISFIABILITY TESTING, SAT 2021, 2021, 12831 : 399 - 416
  • [50] On the complexity of reasoning about dynamic policies
    Goeller, Stefan
    COMPUTER SCIENCE LOGIC, PROCEEDINGS, 2007, 4646 : 358 - 373
12345