• Keine Ergebnisse gefunden

Description Logic

N/A
N/A
Protected

Academic year: 2022

Aktie "Description Logic"

Copied!
1
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Volltext

(1)

Faculty of Computer Science Institute of Theoretical Computer Science, Chair of Automata Theory

Description Logic

Winter Semester 2017/18

Exercise Sheet 11 10th January 2018

Prof. Dr.-Ing. Franz Baader, Dr.-Ing. Stefan Borgwardt

Exercise 11.1 LetT1be anEL-TBox,C,DEL-concepts, andT2 =T1∪ {AvC, Dv B}, where A,Bare new concept names (as in Lemma 6.1). Show thatT2is a conservative extension ofT1. Is this still the case after addingAvBtoT2? What about addingBv A?

Exercise 11.2 Consider the TBox

T ={AvBu ∃r.C, Bu ∃r.BvCuD, Cv(∃r.A)uB, (∃r.∃r.B)uDv ∃r.(AuB)},

whereA,B,C,Dare concept names. Use the classification procedure forELto check whether the following subsumption relationships hold w.r.t.T:

(a) AvB (b) Av ∃r.∃r.A (c) Bu ∃r.Av ∃r.C

1

Referenzen

ÄHNLICHE DOKUMENTE

Gabriele R¨ oger (University of Basel) Theory of Computer Science April 26, 2021 5 /

Gabriele R¨ oger (University of Basel) Theory of Computer Science April 8, 2019 2 / 21?.

Prove with a direct proof: for all finite sets S, the power set P(S) has cardinality 2

If you need a considerably larger amount of steps, rethink your solution and try to find an easier proof.. The solution of part (b) may help you identify the requirements

(a) Transform the following formula into CNF by applying the equivalence rules shown in

Additionaly specify the set of free variables of ϕ

You may use all syntactic sugar introduced in

Which of the following expressions are syntactically correct formulas or terms for the following signature S. Analyse also all subformulas and