<!DOCTYPE html><html><head>
<meta http-equiv="Content-Type" content="text/html; charset=utf-8">
</head>
<body>
<p><b style="font-weight:normal">
<p dir="ltr" style="line-height:1.38;margin-top:0pt;margin-bottom:0pt"><span style="font-weight: 400; text-decoration: none; color: rgb(0, 0, 0);" class="ContentPasted0">Dear members of the DL community,</span></p>
<p dir="ltr" style="line-height:1.38;margin-top:0pt;margin-bottom:0pt"><span style="font-weight: 400; text-decoration: none; color: rgb(0, 0, 0);" class="ContentPasted0">
</span></p>
<p dir="ltr" style="line-height:1.38;margin-top:0pt;margin-bottom:0pt"><span style="font-weight: 400; text-decoration: none; color: rgb(0, 0, 0);" class="ContentPasted0">we are happy to announce the next
edition of Description Logic Seminar Series (<a class="moz-txt-link-freetext" href="https://dl.kr.org/seminar/">https://dl.kr.org/seminar/</a>),
which will be on </span><b style="font-weight:normal"><span style="font-weight: 400; text-decoration: none; color: rgb(0, 0, 0);" class="ContentPasted0">October 4th at 2pm CEST</span></b><span style="font-weight: 400; text-decoration: none; color: rgb(0, 0, 0);" class="ContentPasted0">. This time we will be honored with a
talk by Balder ten Cate (University of Amsterdam).</span></p>
<br class="ContentPasted0">
</b><b style="font-weight:normal">
<p dir="ltr" style="line-height:1.38;margin-top:0pt;margin-bottom:0pt"><span style="text-decoration: none; color: rgb(0, 0, 0); font-weight: 400;" class="ContentPasted0">Title: Fitting Algorithms for
Conjunctive Queries</span></p>
</b><br>
Abstract:<b style="font-weight:normal"><br>
A fitting algorithm for conjunctive queries (CQs) is an
algorithm that takes as input a collection of data examples and
outputs a CQ that fits the examples. In this talk, I will
propose a list of desirable properties of such algorithms and
use it as a guide for surveying recent results obtained in
collaboration with Victor Dalmau, Maurice Funk, Jean Christoph
Jung, and Carsten Lutz (PODS 2023, IJCAI 2023, and IPL 2024). In
particular, I will compare three concrete fitting algorithms,
and we discuss complexity and size bounds for constructing
fitting CQs with different desirable properties. The talk is
based on our SIGMOD Record Research Highlights column.<br>
<br class="ContentPasted0">
<p dir="ltr" style="line-height:1.38;margin-top:0pt;margin-bottom:0pt"><span style="font-weight: 400; text-decoration: none; color: rgb(0, 0, 0);" class="ContentPasted0">The Zoom link for the meeting is: </span><a class="moz-txt-link-freetext" href="https://vu-live.zoom.us/j/95823249660?pwd=bQddajRHbvh0XMc11iQ1Eewqz6LicO.1">https://vu-live.zoom.us/j/95823249660?pwd=bQddajRHbvh0XMc11iQ1Eewqz6LicO.1</a></p>
</b><br>
Meeting ID: 958 2324 9660<br>
<br>
Passcode: 702884<br>
<b style="font-weight:normal">
<p dir="ltr" style="line-height:1.38;margin-top:0pt;margin-bottom:0pt"><span style="font-weight: 400; text-decoration: none; color: rgb(0, 0, 0);" class="ContentPasted0">
</span></p>
<p dir="ltr" style="line-height:1.38;margin-top:0pt;margin-bottom:0pt"><span style="font-weight: 400; text-decoration: none; color: rgb(0, 0, 0);" class="ContentPasted0">Best wishes,</span></p>
</b><br>
<b style="font-weight:normal"> </b><b style="font-weight:normal">
<p dir="ltr" style="line-height:1.38;margin-top:0pt;margin-bottom:0pt"><b style="font-weight:normal"><span style="font-weight: 400; text-decoration: none; color: rgb(0, 0, 0);" class="ContentPasted0">Patrick, </span></b><span style="font-weight: 400; text-decoration: none; color: rgb(0, 0, 0);" class="ContentPasted0">Ana, Bartosz, Quentin</span></p>
</b> </p>
<p><b style="font-weight:normal">
</b></p>
<p dir="ltr" style="line-height:1.38;margin-top:0pt;margin-bottom:0pt"><b style="font-weight:normal"><span style="font-size: 11pt; font-weight: 400; text-decoration: none; color: rgb(0, 0, 0);" class="ContentPasted0">PS: Just a reminder that you can join
the KR community Discord (and the #dl channel) via <a class="moz-txt-link-freetext" href="https://discord.gg/BBWpqEZT2v">https://discord.gg/BBWpqEZT2v</a>.
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. <br>
</span></b></p>
</body>
</html>