<!DOCTYPE html>
<html data-lt-installed="true">
<head>
<meta http-equiv="content-type" content="text/html; charset=UTF-8">
</head>
<body style="padding-bottom: 1px;">
<p> </p>
<div class="moz-text-html" lang="x-unicode">
<h3>NMR Online Seminar</h3>
<p><br>
<font face="monospace"><font size="4">-- Summary:
------------------------------------------------------------------<br>
<br>
What? Next talk in the NMR online talk series by Federica
Di Stefano<br>
When? Wednesday, 12. March 2025, 16:00 CET (UCT+1)<br>
Where? Online (Zoom), see details below<br>
<br>
<a class="moz-txt-link-freetext"
href="https://nmrseminar.krportal.org/">https://nmrseminar.krportal.org/</a><br>
------------------------------------------------------------------------------</font><br>
</font><br>
We are happy to announce that the next talk in the NMR online
talk series will be given by<br>
<b>Federica Di Stefano</b> (TU Wien, Austria)<br>
on <b>Wednesday, 12. January 2025</b>, 16:00 CET:</p>
<p><span><span style="font-weight: bold;">Circumscription et al.,
<span style="font-style: italic;">Minimal Model Reasoning in
Description Logics</span></span></span><br>
<i>Abstract.</i> Adding non-monotonic capabilities to
Description Logics (DLs) has been one of the greatest dreams of
the DL community. This is testified by a thriving family of
formalisms, among which we have circumscribed DLs. One of the
biggest challenges of introducing non-monotonic features to DLs
is the increase in computational complexity and circumscription
is no exception. Nevertheless, circumscribed DLs remain a
flexible and powerful framework that can be used as a host
language for other non-monotonic DLs, e.g., DLs with defeasible
inclusions or the more recent Equilibrium Description Logics. </p>
<p>This talk aims to give an overview of the recent advancements
in DLs with circumscription and other related formalisms based
on forms of predicate minimization. In particular, we will see
an alternative approach to circumscription, namely pointwise
circumscription, which aims to mitigate the computational
complexity of standard circumscription. </p>
<div class="fs-6 collapse show" id="divAbstractGirlandoFeb25"> </div>
<p> This talk will be given via Zoom:<br>
<a class="moz-txt-link-freetext"
href="https://tuwien.zoom.us/j/62945138055?pwd=706TaUrRHGdxVFURNt3WCVb4n8MY9j.1">https://tuwien.zoom.us/j/62945138055?pwd=706TaUrRHGdxVFURNt3WCVb4n8MY9j.1</a><br>
Meeting ID: 629 4513 8055<br>
Password: CNq1VeSZ</p>
<p>The plan of this series to have a talk roughly once per month.
If you are interested in learning the next speakers, please
visit the website at<br>
<a class="moz-txt-link-freetext"
href="https://nmrseminar.krportal.org/">https://nmrseminar.krportal.org/</a></p>
<p>We are still looking for speakers for future talks. If there is
something you would like to present in this seminar series,
please do not hesitate to contact us.</p>
Kind regards,<br>
Jonas and Giovanni<br>
<br>
<p></p>
</div>
</body>
<lt-container></lt-container>
</html>