Realizing RCC8 networks using convex regions

8 years 21 days ago

Download users.cs.cf.ac.uk

RCC8 is a popular fragment of the region connection calculus, in which qualitative spatial relations between regions, such as adjacency, overlap and parthood, can be expressed. While RCC8 is essentially dimensionless, most current applications are conﬁned to reasoning about two-dimensional or threedimensional physical space. In this paper, however, we are mainly interested in conceptual spaces, which typically are high-dimensional Euclidean spaces in which the meaning of natural language concepts can be represented using convex regions. The aim of this paper is to analyze how the restriction to convex regions constrains the realizability of networks of RCC8 relations. First, we identify all ways in which the set of RCC8 base relations can be restricted to guarantee that consistent networks can be convexly realized in respectively 1D, 2D, 3D, and 4D. Most surprisingly, we ﬁnd that if the relation ‘partially overlaps’ is disallowed, all consistent atomic RCC8 networks can be con...

Steven Schockaert, Sanjiang Li

Real-time Traffic