• Keine Ergebnisse gefunden

Description Logics: Syntax, Semantics, Decision Problems, Applications

N/A
N/A
Protected

Academic year: 2022

Aktie "Description Logics: Syntax, Semantics, Decision Problems, Applications"

Copied!
34
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Volltext

(1)

•  Query:  

{ (X) | controlledBy(X, Y) } HLB

BLB HVB

Conceptual  Modeling  and  Query  Answering  

(2)
(3)
(4)
(5)
(6)
(7)
(8)
(9)
(10)
(11)
(12)
(13)
(14)
(15)

Simple reasoning example

Italian English

Person

Lazy LatinLover

{disjoint,covering}

Gentleman Hooligan

{disjoint}

(39)

(16)

Simple reasoning example

Italian English

Person

Lazy LatinLover

{disjoint,covering}

Gentleman Hooligan

{disjoint}

implies

LatinLover = ∅

Italian ⊆ Lazy ItalianLazy

(39)

(17)

Reasoning by cases

LatinLover

Lazy Mafioso ItalianProf

Italian

{disjoint,complete}

{disjoint}

(40)

(18)

Reasoning by cases

LatinLover

Lazy Mafioso ItalianProf

Italian

{disjoint,complete}

{disjoint}

implies

ItalianProf ⊆ LatinLover

(40)

(19)

Infinite worlds: the democratic company

Supervisor

Employee

supervises

0..1 2..2

(42)

(20)

Infinite worlds: the democratic company

Supervisor

Employee

supervises

0..1 2..2

implies

“the classes Employee and Supervisor contain an infinite number of instances”.

Therefore, the schema is inconsistent.

(42)

(21)

Bijection: how many numbers

Natural Number

Even Number

rel

1..1 1..1

(43)

(22)

Bijection: how many numbers

Natural Number

Even Number

rel

1..1 1..1

implies

“the classes ’Natural Number’ and ’Even Number’ contain the same number of instances”.

(43)

(23)

Bijection: how many numbers

Natural Number

Even Number

rel

1..1 1..1

implies

“the classes ’Natural Number’ and ’Even Number’ contain the same number of instances”.

If the domain is finite: Natural Number ≡ Even Number

(43)

(24)
(25)
(26)
(27)
(28)
(29)
(30)
(31)

Task

• Solve the following puzzle:

• There are three chairs on a stage

• On the left chair sits a woman

• On the right chair sits a man

• Assuming that any person sits on the middle chair, does a man sit next to a woman on the stage?

Use description logics to model the scenario and then

Racer to solve the puzzle!

(32)

Task

(33)

Task

(equivalent Person (or Male Female)) (disjoint Male Female)

(instance a Female) (instance c Male) (instance b Person) (related a b nextto) (related b a nextto) (related b c nextto) (related c b nextto) (instance s Stage) (related a s onstage) (related b s onstage) (related c s onstage)

(concept-instances (and Stage (some (inv onstage) (and Male (some nextto Female)))))

(34)

Task

• It works, because all models agree

• Please note that we cannot retrieve “the” man sitting

next to a woman.

Referenzen

ÄHNLICHE DOKUMENTE

Abstract We study the complexity of reasoning in fuzzy description logics with semantics based on finite residuated lattices.. For the logic SHI, we show that deciding satisfia-

The results, for naive semantics are due to (Coste-Marquis, Devred, and Marquis 2005), for stable semantics follows from (Dimopoulos and Torres 1996), for stage semantics have

stage2 semantics is defined in the SCC-recursive schema of cf2 and instantiated in the base case with stage

They are both based on naive sets, thus they are, in contrast to admissible-based semantics, capable to select arguments out of odd-length cycles as accepted.. Consider the

Because the data complexity of evaluating FOL queries in a relational database is complete for the complexity class AC 0 , this implies that the data complexity of answering

We give a polynomial delay algoritm for enumerating MinAs in the Horn setting, show that for dual-Horn KBs the problem is at least as hard as hypergraph transversal enumeration, and

As future work, it would be interesting to extend our upper bound by including more operators from the tractable description logic EL ++ as proposed in [2]. We assume w.l.o.g.

In this paper, we show that reasoning in Horn-SHIQ, in spite of its low data- complexity, is E  T  -hard with respect to the overall size of the knowledge base.. While