Reasoning about Topological and Cardinal Direction Relations Between 2-Dimensional Spatial Objects
Authors: A. G. Cohn, S. Li, W. Liu, J. Renz
JAIR 2014 | Venue PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | In both interpretations, we show that reasoning with topological and directional information is decidable and remains in NP. Our computational complexity results unveil the significant differences between RA and CDC, and that between weak and strong RCC8 models. |
| Researcher Affiliation | Collaboration | Anthony G. Cohn EMAIL School of Computing, University of Leeds, UK Faculty of Engineering and Information Technology, University of Technology Sydney, Australia Sanjiang Li EMAIL AMSS-UTS Joint Research Lab, Centre for Quantum Computation & Intelligent Systems, University of Technology Sydney, Australia College of Computer Science, Shaanxi Normal University, China Weiming Liu EMAIL Baidu (China) Co., Ltd., Shanghai, China Jochen Renz EMAIL Research School of Computer Science, The Australian National University, Australia |
| Pseudocode | Yes | Algorithm 1: BC-CONSISTENCY, where we write CCP(i, j : k) to represent the situation where there exists another variable vl such that vl and vk together are evidence of CCP(i, j). |
| Open Source Code | No | The paper does not provide any statement or link indicating that the authors are releasing source code for the methodology described in this paper. |
| Open Datasets | No | The paper discusses the Angry Birds domain as an application scenario and mentions the Angry Birds AI competition (aibirds.org), where a basic computer vision software 'detects the minimum bounding boxes of all objects'. However, it does not state that the authors used a specific public dataset derived from this domain for empirical evaluation within this paper, nor does it provide concrete access information for any dataset they used. |
| Dataset Splits | No | The paper is theoretical, focusing on computational complexity and algorithm design, and does not describe empirical experiments that would involve dataset splits. |
| Hardware Specification | No | The paper focuses on theoretical aspects of qualitative spatial reasoning, including computational complexity and algorithm design, and does not describe any experimental setup that would require specific hardware specifications. |
| Software Dependencies | No | The paper primarily presents theoretical results on computational complexity and algorithms. It does not detail specific software dependencies or their versions for implementing or replicating the theoretical frameworks discussed. |
| Experiment Setup | No | The paper is theoretical, analyzing the computational complexity of reasoning with spatial relations, and does not include an experimental setup with hyperparameters or training schedules. |