Open Access Open Access  Restricted Access Subscription or Fee Access

Infinite RCC8 Networks

Khalil Challita


In this paper, we solve the problem of determining a consistent instantiation of any path consistent and atomic network of RCC8 base relations. We already know that such networks that contain a finite number of variables have a realization in any dimension d 1. The novelty of our work is that given any path-consistent and atomic constraint RCC8 network, possibly with countably infinite variables, we are able to construct in polynomial time
a realization that satisfies it. For this purpose, we suitably instantiate the variables of such a network by associating to them some regular closed sets of the set of real numbers.


Region Connection Calculus, Constraint satisfaction problems, Qualitative spatial reasoning, Iterative Deepening Search.

Full Text:



  • There are currently no refbacks.

Disclaimer/Regarding indexing issue:

We have provided the online access of all issues and papers to the indexing agencies (as given on journal web site). It’s depend on indexing agencies when, how and what manner they can index or not. Hence, we like to inform that on the basis of earlier indexing, we can’t predict the today or future indexing policy of third party (i.e. indexing agencies) as they have right to discontinue any journal at any time without prior information to the journal. So, please neither sends any question nor expects any answer from us on the behalf of third party i.e. indexing agencies.Hence, we will not issue any certificate or letter for indexing issue. Our role is just to provide the online access to them. So we do properly this and one can visit indexing agencies website to get the authentic information.