Dr Alessandro Seganti from Cognitum presented basics of Semantic Technologies, OntorionCNL, Ontorion Semantic Framework and Fluent Editor during International Conference on Computer Science -- Research and Applications IBIZA 2014, UMCS Lublin.
To learn more visit: http://www.cognitum.eu/semantics/
Call Girls Begur Just Call 👗 7737669865 👗 Top Class Call Girl Service Bangalore
Modeling Ontologies with Natural Language
1. International Conference on computer science – research and applications
IBIZA 2014
21 March 2014 UMCS Lublin
2. Alessandro Seganti
Data Engineer @Cognitum
a.seganti@cognitum.eu
The company, product and service names used in this web site are for identification purposes only.
All trademarks and registered trademarks are the property of their respective owners.
Modeling Ontologies with Natural
Language
Fluent Editor and Ontorion Server
11. Concept/Class definition
young-male-man very-beautiful-girl
Every parent is a person.
Class identifiers start with a small letter and they use
dashes between words, e.g. very-beautiful-girl, young-
male-man.
Classes are defined when their names are used in at least
one sentence.
OWL → FE CNL: VeryBeautifulGirl → very-beautiful-girl
12. Instances
John is a person.
Instance identifier = each part starts with a capital
letter
and they are separated with hyphens
John-Dow Tanker-Accident-X
OWL → FE CNL: JohnDow → John-Dow
The-”K22 P2”
13. Dealing with namespaces
At first line, when creating a new ontology model in FE, you
can declare a default namespace for your ontology.
Namespace: 'http://www.ontorion.com/ontologies/family-model-instances'.
At last lines, you can define references of other ontology
models that you can use when writing the current model.
References: [family] 'http://www.ontorion.com/ontologies/family' ('.family-
model.encnl').
Then, writing the model, you use the reference name with []
together with notions of referenced ontology.
Mary is a woman[family].
Rose has-parent[family] Mary.
19. Concept subsumption
Every boy is a young-male-man.
Saying that one concept subsumes the other we define
IS-A/taxonomic relation and a concept hierarchy.
20. Concept equivalence
Something is a boy if-and-only-if-it
is a young-male-man.
Every boy is a young-male-man.
Every young-male-man is a boy.
Saying that two concepts are equivalent we say that they
also subsumes each other.
21. Concept intersection
Something is a young-male-man
if-and-only-if-it is a young-
thing that is a male-thing and
is a person.
We can define intersections and unions of any given length.
Something is a young-male-man
if-and-only-if-it is a young-
thing and is a male-thing
and is a person.
22. Concept union
Something is a child if-and-only-if-it
is a boy and-or is a girl.
We can define unions of concepts with the use of and-or
keyword.
23. Negations / Complement
Something is a young-thing if-and-only-if-it
is not an adult-thing.
No young-thing is an adult-thing.
Every-single-thing that is a young-thing
is not an adult-thing.
Everything in the world is an adult-thing or a young-thing.
Every young-thing is not an adult-thing.
The classes of young-thing and adult-thing are disjoint.
24. Value partition / Disjoint union
Something is a person if-and-only-if-it-either
is a child, is a young-thing, is a middle-age-
thing or is an old-thing.
A disjoint union axiom states that a class C is a disjoint union
of the class expressions CEi , 1 ≤ i ≤ n, all of which are pairwise
disjoint.
25. • Existential role restrictions
• Universal role restrictions
Every person is-a-child-of
a parent.
Every person is-a-child-of
nothing-but parents.
These restrictions are complementary to each other.
However, they do not imply each other.
Something is a happy-person if-and-only-if-it
has-child a happy-person and has-child
nothing-but happy-persons.
26. Restrictions
Something is a johns-children
if-and-only-if-it has-parent John.
Something is a my-birthday-guests
if-and-only-if-it is either John,
Mary or Bill.
Property value
Enumeration of individuals
27. Property restrictions
Every person is-a-child-of
at-most two parents.
Every person is-a-child-of
at-least two parents.
Every person is-a-child-of
two parents.
keyword
less-than
more-than
≤ at-most
≥ at-least
≠ different-than
= -
28. Restrictions & inversion of roles
Every child is loved by
parents.
We can use inverse of properties in ontology axioms using
„be” and „by” keywords in FE.
29. Keys in ontology
Keys are for uniquely identifying an individual.
Every X that is a person is-unique-if
X has-id something and X has-name something.
32. Axioms on properties (1)
If X has-ancestor something that has-ancestor Y
then X has-ancestor Y. has-ancestor is
transitive
X has-sibling Y if-and-only-if Y has-sibling X. has-sibling is
symmetric
has-child is an
inverse of has-parent
X has-child Y if-and-only-if Y has-parent X.
If X has-child Y then X not has-spouse Y. has-spouse and has-
child are disjoint
33. Axioms on properties (2)
Domain of is-a-wife-
of property is a
woman class
Every-single-thing that is-a-wife-of is a woman.
Range of is-a-wife-of
property is a person
class
Every-single-thing is-a-wife-of nothing-but
persons.
Every-single-thing is not a thing that has-
sibling itself.
Every person likes itself.
has-sibling is irreflexive
likes is reflexive
34. Complex role/property chains
has-parent has-brother
has-uncle
If X has-parent something that has-brother Y
then X has-uncle Y.
Object property chains provide a means to define properties as
a composition of other properties.
SubObjectPropertyOf ( ObjectPropertyChain( OPE1 ... OPEn )
OPE) states that any individual x connected with an individual y
by a chain of object properties expressions OPE1, ..., OPEn is
necessary connected with y by the object property OPE.
35. Data property assertions
John has-name equal-to 'John'.
Lenka borns-on-date equal-to '1975-11-10'.
Tanker-Accident has-time equal-to '2013-07-
08T9:30:40.40'.
36. Data property domain & range
Every-single-thing that has-name (some-value)
is a person.
Every-single-thing has-name nothing-but (some-
string-value).
Keywords used to define date property values are:
some-value, some-string-value, some-integer-value,
some-boolean-value, some-real-value, and some-
datetime-value.
38. Regular expressions
Every-single-thing that has-name that-matches-pattern '.*a'
is a female-person.
Regular expressions
[] alternative sign in square brackets, e.g. [A-Z], [tT]he
[^ ] negation, e.g. [^0-9]
| disjunction, e.g. the|The
? optional previous char, e.g. colou?r
* 0 or more of previous char, e.g. [A-Z][a-z]*
+ 1 or more of previous char
. any char
^ beginning anchor
$ end anchor
39. to learn more visit our website:
www.cognitum.eu/semantics/
Hinweis der Redaktion
Other available in OWL2 and FE CNL restricitons – cardinality ones - deal with allowed & defined number of listed properties.
We can define maximum, minimum and exact cardinalities of properties that are being mentioned in given sentences.
We can use them when we want to specify the number of individuals involved in the restriction. Indeed, we can construct classes depending on the number of children or number of parents. It is possible to declare a maximum, minimum or exact number of parents in our domain. E.g. We can write a sentence: „Every person is-a-child-of at-most two parents.”, that defines a maximum number of allowed properties and assotiations through „is-a-child-of” property. The sentence: „Every person is-a-child-of at-least two parents.” defines a minimum number of allowed associations. And the sentence: „Every person is-a-child-of two parents.” defines an exact number of allowed associations.
Keywords that can be used in this context in FE are: less-than, more-than, at-most, at-least and different-than.
We do not need to explicitly assign a name to the inverse of a property if we just want to use it, say, inside a class expression. Instead of using the new property for the definition of the class child, we can directly refer to it as the love-inverse, that is „is loved by” in FE.
OWL 1 does not provide a means to define keys. However, keys are clearly of vital importance to many applications in order to uniquely identify individuals of a given class by values of (a set of) key properties. The OWL 2 construct HasKey allows keys to be defined for a given class. Keys have been implemented in HermiT, KAON2 and Pellet, and can be added to other reasoners.
In OWL 2 a collection of (data or object) properties can be assigned as a key to a class expression. This means that each named instance of the class expression is uniquely identified by the set of values which these properties attain in relation to the instance.
A simple example of this would be the identification of a person by her social security number or by id and name, e.g. „Every X that is a person is-unique-if X has-id something and X has-name something.”
An HasKey axiom states that each named instance of a class is uniquely identified by a (data or object) property or a set of properties - that is, if two named instances of the class coincide on values for each of key properties, then these two individuals are the same.