Polynomial Realization of ORD-Horn Constraints
We study in this paper the consistency of a subclass of the Allen’s Interval Algebra namely the ORD-Horn networks. More precisely, we consider the Region Connection Calculus RCC5 and RCC8 networks and we prove that these networks have a realization in polynomial time if they satisfy certain conditions. We also prove that subclasses of minimal RCC5 and RCC8 ORD-Horn networks satisfying a specific hypothesis are consistent as well.
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. Also: DOI is paid service which provided by a third party. We never mentioned that we go for this for our any journal. However, journal have no objection if author go directly for this paid DOI service.