BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Date iCal//NONSGML kigkonsult.se iCalcreator 2.20.2//
METHOD:PUBLISH
X-WR-CALNAME;VALUE=TEXT:Eventi DIAG
BEGIN:VTIMEZONE
TZID:Europe/Paris
BEGIN:STANDARD
DTSTART:20231029T030000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:20240331T020000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:calendar.27566.field_data.0@www.ugovricerca.uniroma1.it
DTSTAMP:20260404T185109Z
CREATED:20231206T182914Z
DESCRIPTION:Abstract. Data-intensive applications heavily exploit the avail
 able knowledge about the domain of the data provided in the form of ontolo
 gies\, in particular\, of rule-based ontologies consisting of logical rule
 s of the form 'if some facts are true\, then some other facts are also tru
 e'. This knowledge allows for inferring new implicit information via reaso
 ning that is not explicit in the data\, which is then used according to th
 e needs of the underlying application\, e.g.\, providing more complete ans
 wers to user queries. A key challenge though when reasoning with rule-base
 d ontologies is non-termination. Indeed\, the majority of the practically 
 important rule-based ontology languages identified over the years by the k
 nowledge representation and reasoning research community\, although they s
 trike a good balance between expressiveness and computational complexity o
 f the relevant reasoning services\, do not guarantee the termination of re
 asoning. This is because of the following two factors: the recursive natur
 e of ontological rules (i.e.\, the definition of a predicate may depend on
  itself)\, and the ability of ontological rules to infer new unknown objec
 ts that are not mentioned in the data. This leads to the key problem of un
 iform termination of reasoning: given a rule-based ontology\, is it the ca
 se that reasoning terminates for every input database? The goal of this ta
 lk is to illustrate the technical challenges underlying the above problem\
 , how those challenges are affected by the mode (naive vs. smart) of reaso
 ning\, how they can be overcome\, and what are the interesting open proble
 ms. To this end\, we are going to focus on the guarded family of existenti
 al rules. Short Bio: Andreas Pieris is an Associate Professor at the Unive
 rsity of Edinburgh since 2020 and an Assistant Professor at the University
  of Cyprus since 2021. Prior to this\, he was an Assistant Professor at th
 e University of Edinburgh from 2016 until 2020. His research interests are
  database theory with emphasis on uncertain data\, knowledge representatio
 n and reasoning\, and logic in computer science. He has published numerous
  papers in leading international conferences and journals. He has also ser
 ved on the program committees of several conferences\, including the top-t
 ier database theory and artificial intelligence conferences.    
DTSTART;TZID=Europe/Paris:20231207T140000
DTEND;TZID=Europe/Paris:20231207T140000
LAST-MODIFIED:20231206T190106Z
LOCATION:B203
SUMMARY:Termination Analysis of Rule-based Ontological Reasoning - Andrea P
 ieris
URL;TYPE=URI:http://www.ugovricerca.uniroma1.it/node/27566
END:VEVENT
END:VCALENDAR