Database-Inspired Reasoning Problems in Description Logics With Path Expressions

From International Center for Computational Logic

Database-Inspired Reasoning Problems in Description Logics With Path Expressions

Talk by Bartosz Bednarczyk
This is a status talk (i.e. pre-PHD-defense talk) for the ongoing PHD thesis of Bartosz Bednarczyk, supervised by Sebastian Rudolph (TU Dresden) and Emanuel Kieroński (University of Wrocław). The main goal of the thesis is to study database-inspired reasoning problems (e.g. satisfiability, query entailment or query containment problems) for the very expressive family Z of description logics.


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