<html><head><meta http-equiv="content-type" content="text/html; charset=utf-8"></head><body style="overflow-wrap: break-word; -webkit-nbsp-mode: space; line-break: after-white-space;"><span style="font-size: 16px; font-family: Aptos, Aptos_EmbeddedFont, Aptos_MSFontService, Calibri, Helvetica, sans-serif;">Dear members of the DL community,</span><div><span style="font-size: 16px; font-family: Aptos, Aptos_EmbeddedFont, Aptos_MSFontService, Calibri, Helvetica, sans-serif;"><br></span></div><div><span style="font-size: 16px; font-family: Aptos, Aptos_EmbeddedFont, Aptos_MSFontService, Calibri, Helvetica, sans-serif;">We are very happy to announce the next edition of the Description Logic Seminar, which will take place this Friday at 2pm CET (</span><a href="https://dl.kr.org/seminar" style="font-size: 16px; font-family: Aptos, Aptos_EmbeddedFont, Aptos_MSFontService, Calibri, Helvetica, sans-serif;">https://dl.kr.org/seminar</a><span style="font-size: 16px; font-family: Aptos, Aptos_EmbeddedFont, Aptos_MSFontService, Calibri, Helvetica, sans-serif;">). We will have a talk by </span><font face="Aptos, Aptos_EmbeddedFont, Aptos_MSFontService, Calibri, Helvetica, sans-serif" size="3">Stéphane Demri (LMF, CNRS).</font></div><div><br></div><div><font face="Aptos, Aptos_EmbeddedFont, Aptos_MSFontService, Calibri, Helvetica, sans-serif" size="3">Speaker: Stéphane Demri</font></div><div><font face="Aptos, Aptos_EmbeddedFont, Aptos_MSFontService, Calibri, Helvetica, sans-serif" size="3">Time: June 7, 2024 02:00 PM CET</font></div><div><font face="Aptos, Aptos_EmbeddedFont, Aptos_MSFontService, Calibri, Helvetica, sans-serif" size="3">Title: First Steps Towards Taming Description Logics with Strings</font></div><div><font face="Aptos, Aptos_EmbeddedFont, Aptos_MSFontService, Calibri, Helvetica, sans-serif" size="3"><br></font></div><div><font face="Aptos, Aptos_EmbeddedFont, Aptos_MSFontService, Calibri, Helvetica, sans-serif" size="3">Abstract: We consider a description logic over a concrete domain with the strict prefix order over finite strings. Using an automata-based approach, we show that the concept satisfiability problem w.r.t. general TBoxes is ExpTime-complete for all finite alphabets. As far as we know, this is the first complexity result for an expressive description logic with a nontrivial concrete domain on strings. During the talk, other logics with concrete domains and the approach with constrained automata are also briefly discussed. This is a joint work with Karin Quaas (Leipzig University). Paper available at <a href="https://hal.science/hal-04212642">https://hal.science/hal-04212642</a></font></div><div><br></div><div><br></div><div><font face="Aptos, Aptos_EmbeddedFont, Aptos_MSFontService, Calibri, Helvetica, sans-serif"><div style="font-size: medium;">Zoom link:</div><div style="font-size: medium;"><a href="https://tu-dortmund.zoom.us/j/92764219578?pwd=NWJ2VnB3cy9qSC80VlJ3KzFXNldtUT09">https://tu-dortmund.zoom.us/j/92764219578?pwd=NWJ2VnB3cy9qSC80VlJ3KzFXNldtUT09</a></div><div style="font-size: medium;"><br></div><div style="font-size: medium;">We hope to see many of you there!</div><div style="font-size: medium;"><br></div><div><div style="font-size: 12pt;">Best wishes,</div><div style="font-size: 12pt;"><br></div><div><font size="3">Meghyn, Ana, Jean, and </font><span style="font-size: 12pt;">Magdalena</span></div><div><font size="3"><br></font></div><div><font size="3">PS: Just a reminder that you can join the KR community Discord (and the #dl channel) via <a href="https://discord.gg/BBWpqEZT2v">https://discord.gg/BBWpqEZT2v</a></font><span style="font-size: medium;">. Besides other relevant information regarding the KR & DL communities such as academic events and job offers, you will find talk announcements of the DL Seminar Series and other online events as well.</span></div></div></font></div></body></html>