description logics
DESCRIPTION
Description logics. Description Logics. A family of KR formalisms, based on FOPL decidable, supported by automatic reasoning systems Used for modelling of application domains - PowerPoint PPT PresentationTRANSCRIPT
![Page 1: Description logics](https://reader036.vdocuments.net/reader036/viewer/2022062308/56813205550346895d985844/html5/thumbnails/1.jpg)
Description logics
![Page 2: Description logics](https://reader036.vdocuments.net/reader036/viewer/2022062308/56813205550346895d985844/html5/thumbnails/2.jpg)
Description Logics A family of KR formalisms, based on FOPL
decidable, supported by automatic reasoning systems Used for modelling of application domains Classification of concepts and individuals
concepts (unary predicates), subconcept (subsumption), roles (binary predicates), individuals (constants), constructors for building concepts, equality …
[Baader et al. 2002]
![Page 3: Description logics](https://reader036.vdocuments.net/reader036/viewer/2022062308/56813205550346895d985844/html5/thumbnails/3.jpg)
Applications
software management configuration management natural language processing clinical information systems information retrieval …
Ontologies and the Web
![Page 4: Description logics](https://reader036.vdocuments.net/reader036/viewer/2022062308/56813205550346895d985844/html5/thumbnails/4.jpg)
Outline
DL languages syntax and semantics
DL reasoning services algorithms, complexity
DL systems DLs for the web
![Page 5: Description logics](https://reader036.vdocuments.net/reader036/viewer/2022062308/56813205550346895d985844/html5/thumbnails/5.jpg)
Tbox and Abox
TBOX
Concept and role taxonomies
Intensional knowledge
ABOX
Individuals
Extensional knowledge
Reasoner
![Page 6: Description logics](https://reader036.vdocuments.net/reader036/viewer/2022062308/56813205550346895d985844/html5/thumbnails/6.jpg)
Syntax - AL
R atomic role, A atomic concept
C,D A | (atomic concept)
T | (universal concept, top)
| (bottom concept)
A | (atomic negation)
C D | (conjunction)
R.C | (value restriction)
R.T (limited existential quantification)
![Page 7: Description logics](https://reader036.vdocuments.net/reader036/viewer/2022062308/56813205550346895d985844/html5/thumbnails/7.jpg)
AL[X]
C C (concept negation)
U C U D (disjunction)
E R.C (existential quantification)
N ≥ n R, ≤ n R (number restriction)
Q ≥ n R.C, ≤ n R.C (qualified number restriction)
![Page 8: Description logics](https://reader036.vdocuments.net/reader036/viewer/2022062308/56813205550346895d985844/html5/thumbnails/8.jpg)
Example
Team
Team ≥ 10 hasMember
Team ≥ 11 hasMember hasMember.Soccer-player
![Page 9: Description logics](https://reader036.vdocuments.net/reader036/viewer/2022062308/56813205550346895d985844/html5/thumbnails/9.jpg)
AL[X]
R R S (role conjunction)
I R- (inverse roles)
H (role hierarchies)
F u1 = u2, u1 ≠ u2 (feature (dis)agreements)
![Page 10: Description logics](https://reader036.vdocuments.net/reader036/viewer/2022062308/56813205550346895d985844/html5/thumbnails/10.jpg)
S[X]
S ALC + transitive roles
SHIQ ALC + transitive roles
+ role hierarchies
+ inverse roles
+ number restrictions
![Page 11: Description logics](https://reader036.vdocuments.net/reader036/viewer/2022062308/56813205550346895d985844/html5/thumbnails/11.jpg)
Tbox
Terminological axioms: C = D (R = S) C D (R S) (disjoint C D)
An equality whose left-hand side is an atomic concept is a definition.
A finite set of definitions T is a Tbox (or terminology) if no symbolic name is defined more than once.
![Page 12: Description logics](https://reader036.vdocuments.net/reader036/viewer/2022062308/56813205550346895d985844/html5/thumbnails/12.jpg)
Example Tbox
Soccer-player T
Team ≥ 2 hasMember
Large-Team = Team ≥ 10 hasMember
S-Team = Team ≥ 11 hasMember hasMember.Soccer-player
![Page 13: Description logics](https://reader036.vdocuments.net/reader036/viewer/2022062308/56813205550346895d985844/html5/thumbnails/13.jpg)
DL as sublanguage of FOPL
Team(this) ^
( x1,...,x11: hasMember(this,x1) ^ … ^ hasMember(this,x11)
^ x1 ≠ x2 ^ … ^ x10 ≠ x11)
^ ( x: hasMember(this,x) Soccer-player(x))
![Page 14: Description logics](https://reader036.vdocuments.net/reader036/viewer/2022062308/56813205550346895d985844/html5/thumbnails/14.jpg)
Abox
Assertions about individuals:C(a)R(a,b)
![Page 15: Description logics](https://reader036.vdocuments.net/reader036/viewer/2022062308/56813205550346895d985844/html5/thumbnails/15.jpg)
Example
Ida-member(Sture)
![Page 16: Description logics](https://reader036.vdocuments.net/reader036/viewer/2022062308/56813205550346895d985844/html5/thumbnails/16.jpg)
Individuals in the description language
O {i1, …, ik} (one-of)
R:a (fills)
![Page 17: Description logics](https://reader036.vdocuments.net/reader036/viewer/2022062308/56813205550346895d985844/html5/thumbnails/17.jpg)
Example
(S-Team hasMember:Sture)(IDA-FF)
![Page 18: Description logics](https://reader036.vdocuments.net/reader036/viewer/2022062308/56813205550346895d985844/html5/thumbnails/18.jpg)
Knowledge base
A knowledge base is a tuple < T, A >
where T is a Tbox and A is an Abox.
![Page 19: Description logics](https://reader036.vdocuments.net/reader036/viewer/2022062308/56813205550346895d985844/html5/thumbnails/19.jpg)
Example KB Soccer-player T Team ≥ 2 hasMemberLarge-Team = Team ≥ 10 hasMemberS-Team = Team ≥ 11 hasMember hasMember.Soccer-player
Ida-member(Sture)
(S-Team hasMember:Sture)(IDA-FF)
![Page 20: Description logics](https://reader036.vdocuments.net/reader036/viewer/2022062308/56813205550346895d985844/html5/thumbnails/20.jpg)
AL (Semantics) An interpretation I consists of a non-empty set
I (the domain of the interpretation) and an interpretation function .I which assigns to every atomic concept A a set AI I and to every atomic role R a binary relation
RI I I.
The interpretation function is extended to concept definitions using inductive definitions.
![Page 21: Description logics](https://reader036.vdocuments.net/reader036/viewer/2022062308/56813205550346895d985844/html5/thumbnails/21.jpg)
AL (Semantics)C,D A | (atomic concept)
T | (universal concept)
| (bottom concept)
A | (atomic negation)
C D | (conjunction)
R.C | (value restriction)
R.T | (limited existential quantification)
TI = I
I = Ø
(A)I = I \ AI
(CD)I = CIDI
( R.C)I =
{a I|b.(a,b) RIb CI }
( R.T)I = {a I| b.(a,b) RI}
![Page 22: Description logics](https://reader036.vdocuments.net/reader036/viewer/2022062308/56813205550346895d985844/html5/thumbnails/22.jpg)
ALC (Semantics)
( C)I = I \ CI
(C U D)I = CI U DI
(≥ n R)I = {a I| # {b I | (a,b) RI } ≥ n }
(≤ n R)I = {a I| # {b I | (a,b) RI } ≤ n }
( R.C)I = {a I| b I : (a,b) RI ^ b CI}
![Page 23: Description logics](https://reader036.vdocuments.net/reader036/viewer/2022062308/56813205550346895d985844/html5/thumbnails/23.jpg)
SemanticsIndividual i
iI I
Unique Name Assumption:if i1 ≠ i2 then i1I ≠ i2I
![Page 24: Description logics](https://reader036.vdocuments.net/reader036/viewer/2022062308/56813205550346895d985844/html5/thumbnails/24.jpg)
Semantics
An interpretation .I is a model for a terminology T iff
CI = DI for all C = D in T
CI DI for all a C D in T
CI DI = Ø for all (disjoint C D) in T
![Page 25: Description logics](https://reader036.vdocuments.net/reader036/viewer/2022062308/56813205550346895d985844/html5/thumbnails/25.jpg)
Semantics
An interpretation .I is a model for a knowledge base <T, A > iff
.I is a model for T
aI CI for all C(a) in A
<aI,bI> RI for all R(a,b) in A
![Page 26: Description logics](https://reader036.vdocuments.net/reader036/viewer/2022062308/56813205550346895d985844/html5/thumbnails/26.jpg)
Semantics - acyclic Tbox
Bird = Animal Skin.Feather
I = {tweety, goofy, fea1, fur1}
AnimalI = {tweety, goofy}
FeatherI = {fea1}
SkinI = {<tweety,fea1>, <goofy,fur1>}
BirdI = {tweety}
![Page 27: Description logics](https://reader036.vdocuments.net/reader036/viewer/2022062308/56813205550346895d985844/html5/thumbnails/27.jpg)
Semantics - cyclic Tbox
QuietPerson = Person Friend.QuietPerson( A = F(A) )
I = {john, sue, andrea, bill}PersonI = {john, sue, andrea, bill}FriendI = {<john,sue>, <andrea,bill>, <bill,bill>}
QuietPersonI ={john, sue} QuietPersonI ={john, sue, andrea, bill}
![Page 28: Description logics](https://reader036.vdocuments.net/reader036/viewer/2022062308/56813205550346895d985844/html5/thumbnails/28.jpg)
Semantics - cyclic Tbox
Descriptive semantics: A = F(A) is a constraint stating that A has to be some solution for the equation.
Not appropriate for defining concepts Necessary and sufficient conditions for
concepts
Human = Mammal Parent
Parent.Human
![Page 29: Description logics](https://reader036.vdocuments.net/reader036/viewer/2022062308/56813205550346895d985844/html5/thumbnails/29.jpg)
Semantics - cyclic Tbox
Least fixpoint semantics: A = F(A) specifies that A is to be interpreted as the smallest solution (if it exists) for the equation.
Appropriate for inductively defining concepts
DAG = EmptyDAG U Non-Empty-DAGNon-Empty-DAG = Node Arc.Non-Empty-DAG
Human = Mammal Parent Parent.Human Human =
![Page 30: Description logics](https://reader036.vdocuments.net/reader036/viewer/2022062308/56813205550346895d985844/html5/thumbnails/30.jpg)
Semantics - cyclic Tbox
Greatest fixpoint semantics: A = F(A) specifies that A is to be interpreted as the greatest solution (if it exists) for the equation.
Appropriate for defining concepts whose individuals have circularly repeating structure
FoB = Blond Child.FoB
Human = Mammal Parent Parent.HumanHorse = Mammal Parent Parent.Horse Human = Horse
![Page 31: Description logics](https://reader036.vdocuments.net/reader036/viewer/2022062308/56813205550346895d985844/html5/thumbnails/31.jpg)
Open world vs closed world semantics
Databases: closed world reasoning database instance represents one interpretation absence of information interpreted as negative information “complete information” query evaluation is finite model checkingDL: open world reasoning Abox represents many interpretations (its models) absence of information is lack of information “incomplete information” query evaluation is logical reasoning
![Page 32: Description logics](https://reader036.vdocuments.net/reader036/viewer/2022062308/56813205550346895d985844/html5/thumbnails/32.jpg)
Open world vs closed world semantics
hasChild(Jocasta, Oedipus)
hasChild(Jocasta, Polyneikes)
hasChild(Oedipus, Polyneikes)
hasChild(Polyneikes, Thersandros)
patricide(Oedipus)
patricide(Thersandros)
Does it follow from the Abox that
hasChild.(patricide hasChild. patricide)(Jocasta) ?
![Page 33: Description logics](https://reader036.vdocuments.net/reader036/viewer/2022062308/56813205550346895d985844/html5/thumbnails/33.jpg)
Reasoning services
Satisfiability of concept Subsumption between concepts Equivalence between concepts Disjointness of concepts
Classification
Instance checking Realization Retrieval Knowledge base consistency
![Page 34: Description logics](https://reader036.vdocuments.net/reader036/viewer/2022062308/56813205550346895d985844/html5/thumbnails/34.jpg)
Reasoning services
Satisfiability of concept C is satisfiable w.r.t. T if there is a model I of T such that CI is
not empty.
Subsumption between concepts C is subsumed by D w.r.t. T if CI DI for every model I of T.
Equivalence between concepts C is equivalent to D w.r.t. T if CI = DI for every model I of T.
Disjointness of concepts C and D are disjoint w.r.t. T if CI DI = Ø for every model I of T.
![Page 35: Description logics](https://reader036.vdocuments.net/reader036/viewer/2022062308/56813205550346895d985844/html5/thumbnails/35.jpg)
Reasoning services
Reduction to subsumptionC is unsatisfiable iff C is subsumed by C and D are equivalent iff C is subsumed by D
and D is subsumed by CC and D are disjoint iff C D is subsumed by
The statements also hold w.r.t. a Tbox.
![Page 36: Description logics](https://reader036.vdocuments.net/reader036/viewer/2022062308/56813205550346895d985844/html5/thumbnails/36.jpg)
Reasoning services
Reduction to unsatisfiabilityC is subsumed by D iff C D is unsatisfiableC and D are equivalent iff
both (C D) and (D C) are unsatisfiable C and D are disjoint iff C D is unsatisfiable
The statements also hold w.r.t. a Tbox.
![Page 37: Description logics](https://reader036.vdocuments.net/reader036/viewer/2022062308/56813205550346895d985844/html5/thumbnails/37.jpg)
Tableau algorithms
To prove that C subsumes D: If C subsumes D, then it is impossible for an
individual to belong to D but not to C. Idea: Create an individual that belongs to D and
not to C and see if it causes a contradiction. If always a contradiction (clash) then
subsumption is proven. Otherwise, we have found a model that contradicts the subsumption.
![Page 38: Description logics](https://reader036.vdocuments.net/reader036/viewer/2022062308/56813205550346895d985844/html5/thumbnails/38.jpg)
Tableau algorithms
Based on constraint systems.
S = { x: C D }Add constraints according to a set of
propagation rulesUntil clash or no constraint is applicable
![Page 39: Description logics](https://reader036.vdocuments.net/reader036/viewer/2022062308/56813205550346895d985844/html5/thumbnails/39.jpg)
Tableau algorithms – de Morgan rules
C C
(A B) A U B
(A U B) A B
( R.C) R.( C)
( R.C) R.( C)
![Page 40: Description logics](https://reader036.vdocuments.net/reader036/viewer/2022062308/56813205550346895d985844/html5/thumbnails/40.jpg)
Tableau algorithms – constraint propagation rules
S {x:C1, x:C2} U S
if x: C1 C2 in S
and either x:C1 or x:C2 is not in S
S U {x:D} U S
if x: C1 U C2 in S and neither x:C1 or x:C2 is in S, and D = C1 or D = C2
![Page 41: Description logics](https://reader036.vdocuments.net/reader036/viewer/2022062308/56813205550346895d985844/html5/thumbnails/41.jpg)
Tableau algorithms – constraint propagation rules
S {y:C} U S
if x: R.C in S and xRy in S and y:C is not in S
S {xRy, y:C} U S
if x: R.C in S and y is a new variable and there is no z such that both xRz and z:C are in S
![Page 42: Description logics](https://reader036.vdocuments.net/reader036/viewer/2022062308/56813205550346895d985844/html5/thumbnails/42.jpg)
Example
ST: Tournament
hasParticipant.Swedish SBT: Tournament
hasParticipant.(Swedish Belgian)
![Page 43: Description logics](https://reader036.vdocuments.net/reader036/viewer/2022062308/56813205550346895d985844/html5/thumbnails/43.jpg)
Example 1
SBT => ST? S = { x:
(Tournament hasParticipant.Swedish)
(Tournament
hasParticipant.(Swedish Belgian))
}
![Page 44: Description logics](https://reader036.vdocuments.net/reader036/viewer/2022062308/56813205550346895d985844/html5/thumbnails/44.jpg)
Example 1
S = { x:
(Tournament
U hasParticipant. Swedish)
(Tournament
hasParticipant.(Swedish Belgian))
}
![Page 45: Description logics](https://reader036.vdocuments.net/reader036/viewer/2022062308/56813205550346895d985844/html5/thumbnails/45.jpg)
Example 1
-rule: S = { x: (Tournament U hasParticipant. Swedish) (Tournament
hasParticipant.(Swedish Belgian)), x: Tournament U hasParticipant. Swedish, x: Tournament, x: hasParticipant.(Swedish Belgian)
}
![Page 46: Description logics](https://reader036.vdocuments.net/reader036/viewer/2022062308/56813205550346895d985844/html5/thumbnails/46.jpg)
Example 1
-rule: S = { x:
(Tournament U hasParticipant. Swedish)
(Tournament hasParticipant.(Swedish Belgian)),
x: Tournament
U hasParticipant. Swedish,
x: Tournament,
x: hasParticipant.(Swedish Belgian),
x hasParticipant y, y: (Swedish Belgian)
}
![Page 47: Description logics](https://reader036.vdocuments.net/reader036/viewer/2022062308/56813205550346895d985844/html5/thumbnails/47.jpg)
Example 1
-rule: S= {x: (Tournament U hasParticipant. Swedish)
(Tournament hasParticipant.(Swedish Belgian)),
x: Tournament U hasParticipant. Swedish,
x: Tournament,
x: hasParticipant.(Swedish Belgian),
x hasParticipant y, y: (Swedish Belgian),
y: Swedish, y: Belgian }
![Page 48: Description logics](https://reader036.vdocuments.net/reader036/viewer/2022062308/56813205550346895d985844/html5/thumbnails/48.jpg)
Example 1
U-rule, choice 1 S = { x: (Tournament U hasParticipant. Swedish) (Tournament
hasParticipant.(Swedish Belgian)), x: Tournament U hasParticipant. Swedish, x: Tournament, x: hasParticipant.(Swedish Belgian), x hasParticipant y, y: (Swedish Belgian), y: Swedish, y: Belgian, x: Tournament
}
clash
![Page 49: Description logics](https://reader036.vdocuments.net/reader036/viewer/2022062308/56813205550346895d985844/html5/thumbnails/49.jpg)
Example 1U-rule, choice 2 S = {x: (Tournament U hasParticipant. Swedish) (Tournament
hasParticipant.(Swedish Belgian)), x: Tournament U hasParticipant. Swedish, x: Tournament, x: hasParticipant.(Swedish Belgian), x hasParticipant y, y: (Swedish Belgian),
y: Swedish, y: Belgian, x: hasParticipant. Swedish}
![Page 50: Description logics](https://reader036.vdocuments.net/reader036/viewer/2022062308/56813205550346895d985844/html5/thumbnails/50.jpg)
Example 1choice 2 – continued-rule S = { x: (Tournament U hasParticipant. Swedish) (Tournament hasParticipant.(Swedish Belgian)), x: Tournament U hasParticipant. Swedish, x: Tournament, x: hasParticipant.(Swedish Belgian), x hasParticipant y, y: (Swedish Belgian), y: Swedish, y: Belgian, x: hasParticipant. Swedish, y: Swedish
}
clash
![Page 51: Description logics](https://reader036.vdocuments.net/reader036/viewer/2022062308/56813205550346895d985844/html5/thumbnails/51.jpg)
Example 2
ST => SBT? S = { x:
(Tournament
hasParticipant.(Swedish Belgian))
(Tournament hasParticipant.Swedish)
}
![Page 52: Description logics](https://reader036.vdocuments.net/reader036/viewer/2022062308/56813205550346895d985844/html5/thumbnails/52.jpg)
Example 2
S = { x:
(Tournament
U hasParticipant.( Swedish U Belgian))
(Tournament hasParticipant.Swedish)
}
![Page 53: Description logics](https://reader036.vdocuments.net/reader036/viewer/2022062308/56813205550346895d985844/html5/thumbnails/53.jpg)
Example 2
-rule S = { x: (Tournament
U hasParticipant.( Swedish U Belgian)) (Tournament hasParticipant.Swedish),
x: (Tournament U hasParticipant.( Swedish U Belgian)),x: Tournament,x: hasParticipant.Swedish }
![Page 54: Description logics](https://reader036.vdocuments.net/reader036/viewer/2022062308/56813205550346895d985844/html5/thumbnails/54.jpg)
Example 2
-rule S = { x: (Tournament
U hasParticipant.( Swedish U Belgian)) (Tournament hasParticipant.Swedish),
x: (Tournament U hasParticipant.( Swedish U Belgian)),x: Tournament,x: hasParticipant.Swedish,x hasParticipant y, y: Swedish }
![Page 55: Description logics](https://reader036.vdocuments.net/reader036/viewer/2022062308/56813205550346895d985844/html5/thumbnails/55.jpg)
Example 2
U –rule, choice 1 S = { x: (Tournament
U hasParticipant.( Swedish U Belgian)) (Tournament hasParticipant.Swedish),
x: (Tournament U hasParticipant.( Swedish U Belgian)),x: Tournament,x: hasParticipant.Swedish,x hasParticipant y, y: Swedish,
x: Tournament }
clash
![Page 56: Description logics](https://reader036.vdocuments.net/reader036/viewer/2022062308/56813205550346895d985844/html5/thumbnails/56.jpg)
Example 2
U –rule, choice 2 S = { x: (Tournament
U hasParticipant.( Swedish U Belgian)) (Tournament hasParticipant.Swedish),
x: (Tournament U hasParticipant.( Swedish U Belgian)),x: Tournament,x: hasParticipant.Swedish,x hasParticipant y, y: Swedish, x: hasParticipant.( Swedish U Belgian)
}
![Page 57: Description logics](https://reader036.vdocuments.net/reader036/viewer/2022062308/56813205550346895d985844/html5/thumbnails/57.jpg)
Example 2choice 2 continued–rule S = { x: (Tournament
U hasParticipant.( Swedish U Belgian)) (Tournament hasParticipant.Swedish),
x: (Tournament U hasParticipant.( Swedish U Belgian)),x: Tournament,x: hasParticipant.Swedish,x hasParticipant y, y: Swedish, x: hasParticipant.( Swedish U Belgian),y: ( Swedish U Belgian) }
![Page 58: Description logics](https://reader036.vdocuments.net/reader036/viewer/2022062308/56813205550346895d985844/html5/thumbnails/58.jpg)
Example 2choice 2 continuedU–rule, choice 2.1 S = { x: (Tournament
U hasParticipant.( Swedish U Belgian)) (Tournament hasParticipant.Swedish),
x: (Tournament U hasParticipant.( Swedish U Belgian)),x: Tournament,x: hasParticipant.Swedish,x hasParticipant y, y: Swedish, x: hasParticipant.( Swedish U Belgian),y: ( Swedish U Belgian),y: Swedish } clash
![Page 59: Description logics](https://reader036.vdocuments.net/reader036/viewer/2022062308/56813205550346895d985844/html5/thumbnails/59.jpg)
Example 2choice 2 continuedU–rule, choice 2.2 S = { x: (Tournament
U hasParticipant.( Swedish U Belgian)) (Tournament hasParticipant.Swedish),
x: (Tournament U hasParticipant.( Swedish U Belgian)),x: Tournament,x: hasParticipant.Swedish,x hasParticipant y, y: Swedish, x: hasParticipant.( Swedish U Belgian),y: ( Swedish U Belgian),y: Belgian } ok, model
![Page 60: Description logics](https://reader036.vdocuments.net/reader036/viewer/2022062308/56813205550346895d985844/html5/thumbnails/60.jpg)
Complexity - languages
Overview available via the DL home page at http://dl.kr.org
Example tractable language: A, T, , A, C D, R.C, ≥ n R, ≤ n R
Reasons for intractability: choices, e.g. C U D
exponential size models, e.g interplay universal and existential quantification
Reasons for undecidability: e.g. role-value maps R=S
![Page 61: Description logics](https://reader036.vdocuments.net/reader036/viewer/2022062308/56813205550346895d985844/html5/thumbnails/61.jpg)
Systems
Late
1980s
Early
1990s
Mid
1990s
Late
1990s
undecidable
ExpTime
PSpace
NP
PTime
KL-ONE
NIKL
CLASSIC
Loom
CRACK, KRIS
FaCT, DLP, RACER
Investigation
Of complexity
starts
![Page 62: Description logics](https://reader036.vdocuments.net/reader036/viewer/2022062308/56813205550346895d985844/html5/thumbnails/62.jpg)
Systems
Overview available via the DL home page at http://dl.kr.org
Current systems include: CEL, Cerebra Enginer, FaCT++, fuzzyDL, HermiT, KAON2, MSPASS, Pellet, QuOnto, RacerPro, SHER
![Page 63: Description logics](https://reader036.vdocuments.net/reader036/viewer/2022062308/56813205550346895d985844/html5/thumbnails/63.jpg)
Extensions
Time Defaults Part-of Knowledge and belief Uncertainty (fuzzy, probabilistic)
![Page 64: Description logics](https://reader036.vdocuments.net/reader036/viewer/2022062308/56813205550346895d985844/html5/thumbnails/64.jpg)
![Page 65: Description logics](https://reader036.vdocuments.net/reader036/viewer/2022062308/56813205550346895d985844/html5/thumbnails/65.jpg)
![Page 66: Description logics](https://reader036.vdocuments.net/reader036/viewer/2022062308/56813205550346895d985844/html5/thumbnails/66.jpg)
OWL
OWL-Lite, OWL-DL, OWL-Full: increasing expressivity
A legal OWL-Lite ontology is a legal OWL-DL ontology is a legal OWL-Full ontology
OWL-DL: expressive description logic, decidable XML-based RDF-based (OWL-Full is extension of RDF, OWL-
Lite and OWL-DL are extensions of a restriction of RDF)
![Page 67: Description logics](https://reader036.vdocuments.net/reader036/viewer/2022062308/56813205550346895d985844/html5/thumbnails/67.jpg)
OWL-Lite
Class, subClassOf, equivalentClass intersectionOf (only named classes and restrictions) Property, subPropertyOf, equivalentProperty domain, range (global restrictions) inverseOf, TransitiveProperty (*), SymmetricProperty,
FunctionalProperty, InverseFunctionalProperty allValuesFrom, someValuesFrom (local restrictions) minCardinality, maxCardinality (only 0/1) Individual, sameAs, differentFrom, AllDifferent
(*) restricted
![Page 68: Description logics](https://reader036.vdocuments.net/reader036/viewer/2022062308/56813205550346895d985844/html5/thumbnails/68.jpg)
OWL-DL Type separation (class cannot also be individual or property, property
cannot be also class or individual), Separation between DatatypeProperties and ObjectProperties
Class –complex classes, subClassOf, equivalentClass, disjointWith intersectionOf, unionOf, complementOf Property, subPropertyOf, equivalentProperty domain, range (global restrictions) inverseOf, TransitiveProperty (*), SymmetricProperty, FunctionalProperty,
InverseFunctionalProperty allValuesFrom, someValuesFrom (local restrictions), oneOf, hasValue minCardinality, maxCardinality Individual, sameAs, differentFrom, AllDifferent
(*) restricted
![Page 69: Description logics](https://reader036.vdocuments.net/reader036/viewer/2022062308/56813205550346895d985844/html5/thumbnails/69.jpg)
References
Baader, Calvanese, McGuinness, Nardi, Patel-Schneider. The Description Logic Handbook. Cambridge University Press, 2003.
Donini, Lenzerini, Nardi, Schaerf, Reasoning in description logics. Principles of knowledge representation. CSLI publications. pp 191-236. 1996.
dl.kr.org www.daml.org www.w3.org (owl)
![Page 70: Description logics](https://reader036.vdocuments.net/reader036/viewer/2022062308/56813205550346895d985844/html5/thumbnails/70.jpg)