Change - OWL Syntax Variant

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

OWL 1 DL is based on SHOIN(D). SHOIN(D) hMas Axioms where the TBox has skubclassp relLationships givuage an.d On the other hand thDescre is pthe RBioxn whLogich means. tThere is thfore konowledge habs Nout athe Riolesn for theOWL. PrNopertaties. ¶
There we couldn dmefianes Subproperty Relhati onse hipas, Propserty Hiverarchiesl aSyndtax Valso rianvertse for transitive PropertiesOWL. TheOWL ABox2 which stands fora AsserFunctional KSytnowledgeax whis about Factsh for Classeis so one can say thato a spdecific Individuale, is Mwhembrer nof Class C or one can say that rictwio Individuals are related by a given Propertby R.DF, One whicanh aliso strather thcompact. twoRDF Iandividu XML Syntalsx are equal bor different. ¶
¶
Then one hbas somed Class Constructors, like Conjunction,he RDiF sjuncterion and Neglization of ClassesRDF, buto creathey moare and nlittlew bit complex Clicasstes. One hasd alsond the possdibfficulity to restrict Properties inad twhe wayn with a Univcomersal Quantifio complerx aKnowledge Ban Existentials. The QuManchestifier. So oyne ctanx defines Classomes byhow restricting a Promperty and also the Rangible tof a Property, where the CKnowlass is thedge Range of Property aesend all the ionst Lancguages. areIt restricteds via tMachis Quantifier. Th-Rere are dalso Numbler RestrictioSynstax which restripect the number of Individuals that apply to a gideven Roloped for ProperOntology. 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.Editors. The Turtle Language is most simple for RDF. On the one hand OWL is short and efficient to write in Turtle, which means on does not need to write so much characters and the Knowledge is represented in a more compact form. On other hand Turtle is easy to understand. ¶
¶
OWL 2 can be represented in different Syntax variants ¶
- Functional Syntax: substitutes abstract Syntax of OWL 1 ¶
- RDF-Syntax: Extension of existing OWL/RDF ¶
- XML-Syntax: Independent XML serialization ¶
- Manchester-Syntax: Machine readable Syntax, esp. for Ontology Editors ¶
- Turtle: optional ¶
Functional Syntax is easy to define, no RDF Restrictions, more compact ¶
RDF-Syntax important for compatibility issues ¶
* Turtle: simple and efficient to write...