The color coding means:


: all participate
: Doctoral students participate

Please find the abstracts below the schedule and note that some of the slides are made available here, internally.

All seminars sessions can be accessed via a zoom link that will be provided in due time. The passcodes will be sent around via email. 

The passcodes to the virtual meetings can also be inquired from Sandy Seifarth.

Date Time Topic Speaker Room
April 13 13:00-16:00 Semiring-based Provenance for Light-weight Description Logics Rafael Peñaloza
(University of Milano-Bicocca)
https://tu-dresden.zoom.us/j/81108206775
April 20 13:00-16:00     https://tu-dresden.zoom.us/j/84523500974 
   
April 27 13:00-16:00 TBA Thomas Eiter
(TU Vienna)
https://tu-dresden.zoom.us/j/81108206775
May 11 13:00-16:00 Semiring Provenance for LFP and Strategy Analysis of Büchi Games Erich Grädel
(RWTH Aachen)
https://tu-dresden.zoom.us/j/81108206775
May 18 13:00-16:00     https://tu-dresden.zoom.us/j/84523500974
   
June 01 13:00-16:00     https://tu-dresden.zoom.us/j/81108206775
June 08 13:00-16:00     https://tu-dresden.zoom.us/j/84523500974
   
June 15 13:00-16:00 TBA Jan Křetínský
(TU Munich)
https://tu-dresden.zoom.us/j/81108206775
June 22 13:00-16:00 TBA  Zoltán Fülöp
(
University of Szeged)
https://tu-dresden.zoom.us/j/81108206775 
July 06 13:00-16:00     https://tu-dresden.zoom.us/j/81108206775
July 13 13:00-16:00     https://tu-dresden.zoom.us/j/84523500974
   
July 20 13:00-16:00     https://tu-dresden.zoom.us/j/81108206775





Abstracts


Rafael Peñaloza: Semiring-based Provenance for Light-weight Description Logics

Semiring-based provenance was originally studied in database theory to assign additional semantics to facts, and to the query answers that can be derived from them. This approach has been recently extended to ontologies, assigning a provenance token to each axiom in the ontology. Consequences from this ontology inherit a provenance value represented by a polynomial. In this talk, we present this provenance approach over light-weight description logics, showing that its semantics presents several difficulties for handling conjunctions. Assuming multiplicative idempotency mitigates these issues and allows for effective reasoning methods. In particular, we present a new automata-based construction for answering simple provenance queries in a variant of the DL EL.