• Keine Ergebnisse gefunden

Deductive Databases & Knowledge Based Systems Sheet 12

N/A
N/A
Protected

Academic year: 2021

Aktie "Deductive Databases & Knowledge Based Systems Sheet 12"

Copied!
1
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Volltext

(1)

KBS

Institut für Informationssysteme – TU Braunschweig - http://www.ifis.cs.tu-bs.de

Technische Universität Braunschweig Institut für Informationssysteme http://www.ifis.cs.tu-bs.de Christoph Lofi

Deductive Databases & Knowledge Based Systems Sheet 12

Exercise 1

Try to answer briefly, precisely and understandable.

1. What are ABox, TBox, and RBox?

2. What is reification and what is the problem with it?

Exercise 2

Download Protégé 4 from http://protege.stanford.edu/ and open the University Ontology on our webpage.

1. Play around with the ontology, try to perform some classifications or queries.

2. If you add ¬Professor to the equivalence classes statement of Teacher, also Chris- toph disappears from the Teachers class. Why?

3. Add the following concepts at a useful place in the ontology (if possible – if not, guess why it does not work):

a. Intitute (with a property leadBy to Person and some useful properties to Lecture and University)

b. The property supervises which is a subproperty of teaches. Somebody su- pervises a lecture if he/she is the professor of the institute to which the lec- ture belongs.

c. ComputerScienceLecture, EconomicsLecture

d. CSStudent (Somebody is a CSStudent if he/she attends at least 3 CS lectures) e. EconomicsStudent (Somebody is a EconomicsStudent if he/she attends at

least 3 economics lectures)

f. Test your ontology! (maybe add some individuals to run the tests…)

Referenzen

ÄHNLICHE DOKUMENTE

• The basic building blocks of description logics are concepts, roles and individuals.. – Like with frame systems, think of concepts like OO classes

13.1 Generating ontologies 13.2 Collective Intelligence 13.3 Folksonomies.. 13

topic of question is Godzilla, text contains named entity Godzilla. • Sentence proximity between passage

–  Base building blocks are formulas, i.e.. •  When using a variable term in a statement in natural language, you may assign some value. –  ‘something

– Thus, Herbrand interpretation can be defined by listing all atoms from the base which evaluate to true. •  A Herbrand interpretation can identified with a subset of the

•  Proof Sketch: “Show that the consistency of Peano arithmetic directly follows from the Goodstein theorem. If Goodstein was provable within Peano, the consistency of Peano

•  For more expressive logic languages (like Prolog), deductive systems are used to find the truth values for the elements of the Herbrand universe.

–  On the union of those rules and the previous ground instances, apply normal fixpoint iteration..