PAC Completion of Description Logic TBoxes

Talk by Sergei Obiedkov

Location: APB room 3027
Start: 11. January 2024 at 11:00 am
End: 11. January 2024 at 12:00 pm
Event series: Research Seminar Logic and AI
iCal

Abstract: In description logic knowledge bases, there may be a need to ensure that the terminological part of the base is complete in the sense that it captures all relevant relations between concepts. In [1], a method was proposed that does this for a user-specified subset of concepts. The method is based on attribute exploration from formal concept analysis [2] and uses queries to acquire knowledge from a domain expert. It may however require an exponential (in the size of the output) number of queries. I will present a probably approximately correct version of the method based on an algorithm for learning propositional Horn formulas [3]. The method works for an arbitrary DL language allowing the bottom concept, conjunction, and negation.

This is a joint work with Barış Sertkaya (Frankfurt University of Applied Sciences).

The talk will take place in a hybrid fashion, physically in the APB room 3027, and online through the link:

https://bbb.tu-dresden.de/b/pio-zwt-smp-aus