Axioms
RCC is governed by two axioms. * for any region x, x connects with itself * for any region x, y, if x connects with y, y will connects with xRemark on the axioms
The two axioms describe two features of the connection relation, but not the characteristic feature of the connect relation.Dong 2008 For example, we can say that an object is less than 10 meters away from itself and that if object A is less than 10 meters away from object B, object B will be less than 10 meters away from object A. So, the relation 'less-than-10-meters' also satisfies the above two axioms, but does not talk about the connection relation in the intended sense of RCC.Composition table
The composition table of RCC8 are as follows: * "*" denotes the universal relation, no relation can be discarded. Usage example: if a TPP b and b EC c, (row 4, column 2) of the table says that a DC c or a EC c.Examples
The RCC8 calculus is intended for reasoning about spatial configurations. Consider the following example: two houses are connected via a road. Each house is located on an own property. The first house possibly touches the boundary of the property; the second one surely does not. What can we infer about the relation of the second property to the road? The spatial configuration can be formalized in RCC8 as the following constraint network: house1 DC house2 house1 property1 house1 property2 house1 EC road house2 property1 house2 NTPP property2 house2 EC road property1 property2 road property1 road property2 Using the RCC8 composition table and the path-consistency algorithm, we can refine the network in the following way: road property1 road property2 That is, the ''road'' either overlaps (PO) ''property2'', or is a tangential proper part of it. But, if the ''road'' is a tangential proper part of ''property2'', then the ''road'' can only be externally connected (EC) to ''property1''. That is, ''road PO property1'' is not possible when ''road TPP property2''. This fact is not obvious, but can be deduced once we examine the consistent "singleton-labelings" of the constraint network. The following paragraph briefly describes singleton-labelings. First, we note that the path-consistency algorithm will also reduce the possible properties between ''house2'' and ''property1'' from ' to just ''DC''. So, the path-consistency algorithm leaves multiple possible constraints on 5 of the edges in the constraint network. Since each of the multiple constraints involves 2 constraints, we can reduce the network to 32 (5^2) possible unique constraint networks, each containing only single labels on each edge (''"singleton labelings''"). However, of the 32 possible singleton labelings, only 9 are consistent. (SeRCC8 use in GeoSPARQL
RCC8 has been partially implemented inImplementations
See also
*References
Bibliography
* * . * * {{cite journal, ref=tdong, first=Tiansi , last= Dong , title=A Comment on RCC: From RCC to RCC⁺⁺, jstor=41217909, journal=Journal of Philosophical Logic, volume=34, issue=2, pages=319–352, date=2008, doi=10.1007/s10992-007-9074-y, s2cid=6243376 . Reasoning Knowledge representation Constraint programming Computational topology Logical calculi