BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//labri.fr//NONSGML kigkonsult.se iCalcreator 2.41.92//
CALSCALE:GREGORIAN
METHOD:PUBLISH
UID:49f06e85-0546-4e1e-b33b-cd2e1392e0fc
X-WR-CALNAME:[RATIO] Sanja Lukumbuzya
X-WR-TIMEZONE:Europe/Paris
BEGIN:VTIMEZONE
TZID:Europe/Paris
TZUNTIL:20240331T010000Z
BEGIN:STANDARD
TZNAME:CET
DTSTART:20211031T030000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RDATE:20221030T030000
RDATE:20231029T030000
END:STANDARD
BEGIN:DAYLIGHT
TZNAME:CEST
DTSTART:20220327T020000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RDATE:20230326T020000
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:49f06e85-0546-4e1e-b33b-cd2e1392e0fc
DTSTAMP:20260504T204426Z
CLASS:PUBLIC
DESCRIPTION:Title: Bounded Predicates in Description Logics with Counting 
 \nAbstract: A distinguishing feature of Description Logics (DLs)\, aimed a
 t dealing with information incompleteness\, is the ability to describe and
  reason about anonymous objects\, that is\, elements in the domain of inte
 rest that are not represented by known individuals but whose existence is 
 logically implied by the background knowledge. And while this feature sign
 ificantly contributes to the expressiveness of DLs\, it also causes substa
 ntial computational challenges if the number of anonymous is not bounded. 
 However\, in many practical scenarios\, numeric constraints present in the
  ontology allows us to infer an upper bound on the number of anonymous obj
 ects in extensions of relevant predicates. In this talk\, I will present t
 he results from our recent paper that investigates reasoning about upper b
 ounds on predicate sizes for ontologies written in the expressive DL ALCHO
 IQ with closed predicates using integer programming.
DTSTART;TZID=Europe/Paris:20220531T140000
DTEND;TZID=Europe/Paris:20220531T150000
LOCATION:178
SEQUENCE:0
SUMMARY:[RATIO] Sanja Lukumbuzya
TRANSP:OPAQUE
END:VEVENT
END:VCALENDAR
