BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//GREYC UMR CNRS 6072 - Groupe de Recherche en Informatique, Image, et Instrumentation de Caen - ECPv5.7.0//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:GREYC UMR CNRS 6072 - Groupe de Recherche en Informatique, Image, et Instrumentation de Caen
X-ORIGINAL-URL:https://www.greyc.fr
X-WR-CALDESC:évènements pour GREYC UMR CNRS 6072 - Groupe de Recherche en Informatique, Image, et Instrumentation de Caen
BEGIN:VTIMEZONE
TZID:Europe/Paris
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20240331T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20241027T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20240116T104500
DTEND;TZID=Europe/Paris:20240116T114500
DTSTAMP:20260422T211804
CREATED:20230922T072250Z
LAST-MODIFIED:20240116T093733Z
UID:11262-1705401900-1705405500@www.greyc.fr
SUMMARY:Séminaire Algorithmique : « Learning Linear Temporal Logic »\, Nathanaël Fijalkow (CNRS\, LaBRI\, Univ. Bordeaux)
DESCRIPTION:We consider the problem of learning a logical formula from a set of positive and negative examples. The logic we target is Linear Temporal Logic (LTL)\, a prominent formalism in program verification and analysis\, software engineering\, and robot motion planning. \nWe’ll discuss on the one hand theoretical results\, in particular NP-completeness\, and on the other hand a practical approach\, arguing that the problem is a perfect match for GPUs (Graphical Processing Units). No knowledge of LTL or GPU will be required to follow the talk.
URL:https://www.greyc.fr/event/seminaire-algorithmique-nathanael-fijalkow-cnrs-labri-univ-bordeaux/
LOCATION:Sciences 3- S3 351
CATEGORIES:Amacc,General,News,Séminaire Algo
END:VEVENT
END:VCALENDAR