BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//LORIA - ECPv6.17.4.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:LORIA
X-ORIGINAL-URL:https://www.loria.fr
X-WR-CALDESC:Évènements pour LORIA
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Europe/Paris
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20200329T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20201025T010000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20210328T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20211031T010000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20220327T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20221030T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20210401T130000
DTEND;TZID=Europe/Paris:20210401T143000
DTSTAMP:20210330T154147Z
CREATED:20210319T134650Z
LAST-MODIFIED:20210330T154147Z
UID:11789-1617282000-1617287400@www.loria.fr
SUMMARY:Colloquium Loria : Mathieu d'Aquin
DESCRIPTION:Mathieu d’Aquin\, Professor of Informatics specialised in data analytics and semantic technologies at the Data Science Institute and the Insight Centre for Data Analytics of the National University of Ireland Galway\, is the next speaker for Loria’s colloquium. \nThe colloquium will take place on Teams on Thursday\, April 1st at 1pm\, with a presentation entitled « Data and knowledge as commodities ». \nAbstract: While data has become increasingly available in the last few years\, those data and the models used to analyse them are becoming less and less interpretable. In other words\, the challenge of turning such vast amounts of data into exploitable knowledge is still present. In this presentation\, I aim to describe ongoing efforts to address this challenge by combining current data mining and machine learning techniques with traditional\, symbolic methods for artificial intelligence based on explicit knowledge representations and inferences. In particular\, taking examples from projects in education\, smart cities and the digital humanities\, I show how the legacy of the semantic web\, especially web-scale knowledge graphs and ontologies\, can support intelligent methods for data understanding and the interpretability of machine learning models.
URL:https://www.loria.fr/event/colloquium-loria-mathieu-daquin/
CATEGORIES:Colloquium Loria
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20210420T133000
DTEND;TZID=Europe/Paris:20210420T150000
DTSTAMP:20210409T120947Z
CREATED:20210409T101721Z
LAST-MODIFIED:20210409T120947Z
UID:12004-1618925400-1618930800@www.loria.fr
SUMMARY:Colloquium Loria - CELLO Team
DESCRIPTION:Next Colloquium will take place on Tuesday\, 20th April at 1:30 pm on Teams. \nWe are glad to welcome the CELLO team\, with presentations given by our colleagues Hans van Ditmarsch\, Marta Gawek and Mo Liu. \n \n\nProgram and abstracts: \n13:30 – 14:00 \n\nspeaker: Hans van Ditmarsch\, CELLO @ LORIA\ntitle: Knowledge and simplicial complexes\nabstract: Simplicial complexes are a versatile and convenient paradigm on which to build all the tools and techniques of the logic of knowledge\, on the assumption that initial epistemic models can be described in a distributed fashion. Thus\, we can define: knowledge\, belief\, bisimulation\, the group notions of mutual\, distributed and common knowledge\, and also dynamics in the shape of simplicial action models. We give a survey on how to interpret all such notions on simplicial complexes\, building upon the foundations laid in prior work by Goubault et al. More recent work investigates so-called impure simplicial complexes\, that also take into account crashed processes.\nReferences:\n[1] Hans van Ditmarsch\, Eric Goubault\, Jérémy Ledent\, and Sergio Rajsbaum. Knowledge and simplicial complexes. To appear. CoRR abs/2002.08863\, 2020.\n[2] Hans van Ditmarsch. Wanted Dead or Alive: Epistemic logic for impure simplicial complexes. CoRR abs/2103.03032\, 2021.\n\n        Joint work with Éric Goubault\, Jérémy Ledent\, and Sergio Rajsbaum. \n\n\n  \n14:00 – 14:30 \n\nspeaker: Marta Gawek\, CELLO @ LORIA\ntitle: An epistemic separation logic with action models\nabstract: We investigate extensions of separation logic with epistemic and dynamic epistemic modalities. Separation logics are based on the intuitionistic logic of bunched implications (BI) or its classical counterpart Boolean BI. These logics combine additive and multiplicative connectives in the language\, expressing the notions of resource composition and resource decomposition. Epistemic Separation Logic with Action Models (ESLAM) is a generalization of the Public Announcement Separation Logic (PASL) of Courtault et al. We present the syntax and semantics of ESLAM as well as reduction axioms for the elimination of dynamic modalities.\nReferences: [1] Jean-René Courtault\, Hans van Ditmarsch\, and Didier Galmiche. A Public Announcement Separation Logic. Mathematical Structures in Computer Science 29(6):828–871\, 2019.\n[2] David Pym. The Semantics and Proof Theory of the Logic of Bunched Implications\, Springer\, 2002.\n[3] Hans van Ditmarsch\, Didier Galmiche\, and Marta Gawek. An Epistemic Separation Logic with Action Models. Proceedings of 9th ICLA\, 2021.Joint work with Hans van Ditmarsch and Didier Galmiche.\n\n\n14:30 – 15:00 \n\nspeaker: Mo Liu\, CELLO @ LORIA\ntitle: Expressivity of some versions of APAL\nabstract: Arbitrary public announcement logic (APAL) is a logic of change of knowledge with   modalities representing quantification over announcements. It extends public announcement logic (PAL). We present three rather different versions of APAL: FSAPAL only quantifies over announcements containing a finite subset of all propositional variables. SCAPAL only quantifies over announcements containing variables occurring in the formula bound by the quantifier. IPAL quantifies over announcements implying a given formula. We determine the relative expressivity of FSAPAL\, SCAPAL and IPAL in relation to APAL and PAL.\nReferences:\n[1] Hans van Ditmarsch\, Mo Liu\, Louwe B. Kuijer\, and Igor Sedlár. Expressivity of Some Versions of APAL. Proceedings of DaLí 2020\, pp 120-136\, 2020.\n\n\n        Joint work with Hans van Ditmarsch\, Louwe B. Kuijer\, and Igor Sedlár.
URL:https://www.loria.fr/event/12004/
LOCATION:online
CATEGORIES:Colloquium Loria
END:VEVENT
END:VCALENDAR