Extending Matching in Description Logics: Unterschied zwischen den Versionen
Aus International Center for Computational Logic
Irina Dragoste (Diskussion | Beiträge) (Die Seite wurde neu angelegt: „{{Veranstaltung |Titel EN=Extending Matching in Description Logics |Beschreibung EN=Matching concept descriptions against concept patterns was introduced as a…“) |
Irina Dragoste (Diskussion | Beiträge) Keine Bearbeitungszusammenfassung |
||
| (3 dazwischenliegende Versionen desselben Benutzers werden nicht angezeigt) | |||
| Zeile 7: | Zeile 7: | ||
|Raum=APB 2026 | |Raum=APB 2026 | ||
|Vortragender=Pavlos Marantidis | |Vortragender=Pavlos Marantidis | ||
|Forschungsgruppe=Computational Logic, Wissensbasierte Systeme | |Forschungsgruppe=Automatentheorie, Computational Logic, Wissensbasierte Systeme | ||
|Event series=KBS Seminar | |||
|In News anzeigen=1 | |In News anzeigen=1 | ||
}} | }} | ||
Aktuelle Version vom 18. Oktober 2018, 03:30 Uhr
Extending Matching in Description Logics
Vortrag von Pavlos Marantidis
- Veranstaltungsort: APB 2026
- Beginn: 27. September 2018 um 13:00
- Ende: 27. September 2018 um 14:30
- Forschungsgruppe: Automatentheorie
- Forschungsgruppe: Computational Logic
- Forschungsgruppe: Wissensbasierte Systeme
- Event series: KBS Seminar
- iCal
Matching concept descriptions against concept patterns was introduced as a non-standard inference task in Description Logics motivated by applications in knowledge bases. It was first investigated for the DL FL0, for which a polynomial-time algorithm was obtained. In this talk, we will present recent results that extend matching in FL0 in two aspects. Initially, we investigate approximate matching, that increases the recall of the method by checking whether the input description and pattern can “almost” match, rather than become equivalent. The meaning of almost is formalised using distance measures between concepts. Afterwards, we examine matching in the presence of TBoxes, i.e., background knowledge of concept inclusions. It is well-known that subsumption reasoning in FL0 rises from P to ExpTime when TBoxes are considered, and we prove that the same is true for matching. Finally, we present some preliminary ideas on approximate matching in the presence of TBoxes.
