TY - JOUR
T1 - Qualitative spatial logics for buffered geometries
AU - Du, Heshan
AU - Alechina, Natasha
N1 - Publisher Copyright:
© 2016 AI Access Foundation. All rights reserved.
PY - 2016/8
Y1 - 2016/8
N2 - This paper describes a series of new qualitative spatial logics for checking consistency of same As and part Of matches between spatial objects from different geospatial datasets, especially from crowd-sourced datasets. Since geometries in crowd-sourced data are usually not very accurate or precise, we boffer geometries by a margin of error or a level of tolerance σ ∈ℝ ≤0, and define spatial relations for boffered geometries. The spatial logics formalize the notions of 'boffered equal' (intuitively corresponding to 'possibly same As'), 'boffered part of' ('possibly part Of'), 'near' ('possibly connected') and 'far' ('definitely disconnected'). A sound and complete axiomatisation of each logic is provided with respect to models based on metric spaces. For each of the logics, the satisfiability problem is shown to be NP-complete. Finally, we briey describe how the logics are used in a system for generating and debugging matches between spatial objects, and report positive experimental evaluation results for the system.
AB - This paper describes a series of new qualitative spatial logics for checking consistency of same As and part Of matches between spatial objects from different geospatial datasets, especially from crowd-sourced datasets. Since geometries in crowd-sourced data are usually not very accurate or precise, we boffer geometries by a margin of error or a level of tolerance σ ∈ℝ ≤0, and define spatial relations for boffered geometries. The spatial logics formalize the notions of 'boffered equal' (intuitively corresponding to 'possibly same As'), 'boffered part of' ('possibly part Of'), 'near' ('possibly connected') and 'far' ('definitely disconnected'). A sound and complete axiomatisation of each logic is provided with respect to models based on metric spaces. For each of the logics, the satisfiability problem is shown to be NP-complete. Finally, we briey describe how the logics are used in a system for generating and debugging matches between spatial objects, and report positive experimental evaluation results for the system.
UR - https://www.scopus.com/pages/publications/84988614807
U2 - 10.1613/jair.5140
DO - 10.1613/jair.5140
M3 - Article
AN - SCOPUS:84988614807
SN - 1076-9757
VL - 56
SP - 693
EP - 745
JO - Journal of Artificial Intelligence Research
JF - Journal of Artificial Intelligence Research
ER -