Theory - Instantiation
Towards a General Ontology Theory (ONMA)
Instantiation
The smallest instantiation step is to create or update a (s, p, o) triple. There either a data property or an object property is involved. The first requires a Data Property Definition (DPD) as template, the second an Object Property Definition (OPD). Instantiation patterns specify what form the resulting triple must have. Now we define patterns for Data Property Instantiation (DPI) and Object Property Instantiation (OPI) where a ∈ A is a Data Property, adt ∈ ADT is an Atomic Data Type, u is a universal either from the set C of classes or from the set R of object properties, ^C and ^D are classes, and v is a value from the value set of attribute a:
Data Property Instantiation (DPI):
(u, A, adt) ⊧ (x, A, v)where(x, »pof, u)orx ∈ ∴u(◊OP, A, adt) ⊧ (»OPI, A, v)for relators with(»OPI, »opi, ◊OP)
Object Property Instantiation (OPI):
- OPI: Let
>P1 ∈ pof(^C)and>P2 ∈ pof(^D), then(>P1, »OP, >P2)is an object property instance of(^C, ◊OP, ^D). - PPR:
(>P, »isOPOf, ^C), or also its inverse(^C, »hasOP, >P)both mean that for an OPD(^Person, ◊isDesignerOf, ^Car)the particular>Pon the particulars layer is connected with^Con the schema layer, for example,(>Ferdi_Porsche,and»isDesignerOf, ^VW_Beetle)(^VW_Beetle,.»hasDesigner, >Ferdi_Porsche)
Object Property Instantiation Rules (OPIR):
- PPR:
(^C,◊OP,^D) ⊧ (>P1,»OP,>P2);(^D,◊OPOf,^C) ⊧ (>P2,»OPOf,>P1) - CPR:
(^C,◊OP,^D) ⊧ (^C,»OP,>P);(^D,◊OPOf,^C) ⊧ (>P,»OPOf,^C)
Extension: deriver.app
Back to Theory — Introduction; Deriver documentation.
Source: taoke.de — Theory - Instantiation.