The fundamental reasoning problem in RCC-8 is deciding In contrast to the synthetic RCC-8 networks that have the consistency of a set of constraints Θ, i.e., whether there been used in the literature for evaluating the aforementioned is a spatial configuration where the relations between the reasoners, the real-world networks of Table 1 are very sparse regions can be described by Θ. Traditionally in qualitative and one to two orders of magnitude larger. The labels on spatial reasoning (QSR) consistency of such sets is decided their edges contain 1 or 2 base RCC-8 relations forming a by a backtracking algorithm which optionally uses a pathconsistency disjunction. This kind of networks have not been employed algorithm as a preprocessing step for forward in any experimental evaluation of RCC-8 reasoners with the checking. In general, this problem is NPcomplete (Renz exception of (Sioutis and Koubarakis 2012) in which the network and Nebel 1999). However it has been shown in (Renz 1999) adm1 has been used. Typically, the literature focuses that there are tractable subsets of RCC-8 for which the consistency on quite smaller networks (20 to 1000 nodes) with an average problem can be decided by path-consistency. of 4 base RCC-8 relations per edge, and an average Table 1 depicts the characteristics of some real-world node degree ranging from 4 to 20. Deciding the consistency RCC-8 networks recording the topological relations between of real-world networks is a very important task. Inconsistencies administrative regions in Europe (networks nuts, might arise because their RCC-8 relations are computed adm1, and adm2) and the world (networks gadm1 and based on the geometries of geographical objects which gadm2), and the performance of the following reasoners often have not been captured correctly (e.g., overlapping geometries regarding consistency checking: Renz-Nebel01 (Renz and between two regions that in principle are externally Nebel 2001), GQR-1500 (Gantner, Westphal, and Woelfl connected). This is the case for the networks gadm1 and 2008; Westphal and Hué 2012), PPyRCC8 (Sioutis and gadm2.