1, refer to the case of single NINF types (start nodes), INF-NINF, NINF-NINF, and INF-INF pairs of types, respectively.
bin] (referred to as binary regular schema) that, with respect to the former, has the NINF types expressed by only using binary inheritance (i.
bin] is a NINF type defined as: type [Tau] = [[Tau].
As already mentioned, the nodes of the R-graph are labeled with all the NINF types of the schema (start nodes), and all the unordered pairs of types whose meet is required in order to accomplish the inheritance process for the NINF types of the schema.
Then, there exists a NINF type T and a node ([[Tau].
Then, there exists a NINF type [Tau] such that ([Tau]) R* (([[Tau].
It starts by computing the nodes adjacent to the start nodes, that is, labeled with the NINF types [Tau] in ([[Sigma].
bin]), a is also the number of NINF types of ([[Sigma].
Schema correctness, which depends on the inheritance hierarchy, is twofold: it requires the absence of unsolvable inheritance conflicts and the termination of the inheritance process for all the NINF types of the schema.
bin], whose NINF types are all expressed by using binary inheritance, is formally introduced.
Let [Tau] be a NINF type of a regular schema [Sigma] defined by means of m + 1 (m [is greater than or equal to] 2) parents, that is,