Change - OWL

Created on March 11, 2013, 4:16 p.m. by Hevok & updated on March 11, 2013, 4:17 p.m. by Hevok

OWL 1 DL is based on SHOIN(D). SHOIN(D) has Axioms where the TBox has subclass relationships given. On the other hand there is the RBox which means there is the knowledge about the Roles or the Properties. ¶
There we could define Subproperty Relationships, Property Hierarchies and also inverse or transitive Properties. The ABox which stands for Assertional Knowledge is about Facts for Classes so one can say that a specific Individual is Member of Class C or one can say that two Individuals are related by a given Property R. One can also state that two Individuals are equal or different. ¶
¶
Then one has some Class Constructors, like Conjunction, Disjunction and Negation of Classes to create more and new complex Classes. One has also the possibility to restrict Properties in the way with a Universal Quantifier and an Existential Quantifier. So one can define Classes by restricting a Property and also the Range of a Property, where the Class is the Range of Property and all the instances are restricted via this Quantifier. There are also Number Restrictions which restrict the number of Individuals that apply to a given Role or Property. For example the Quartet of a String Quartet consists of no more or exactly four Persons. In the end one has also something like closed Classes or enumerated Classes, which are Nominals in Description Logics. There one defines a Class by simple enumerating its Members which are Individuals. Datatypes are Integers and Strings ad so which are needed to be somehow compatible to the usual Programming Languages. ¶
¶
Axoims ¶
- TBox: Subclass Relationships C ⊑ D ¶
- RBox: Subproperty Relationships R ⊑ S (H), ¶
inverse Properties R- (I), transitivity ⊑+ (S) ¶
- ABox: Facts for Classes C(a), Properties R(a,b), equality a = b, difference a ≠ b ¶
Class Constructors: ¶
- Conjunction C⊓D, Disjunction C⊔D, Negation ¬C of Classes ¶
- Property Restrictions: Universal ∀R.C and existential ∃R.C ¶
- number restrictions: ≤n R and ≥ R (N) ¶
- Closed Classes (Nominals): {a} (O) ¶
* Datatypes (D) ¶
¶
SHOINQ(D) contains all of that which is in SHOIN(D) plus more.