BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//wp-events-plugin.com//7.2.3.1//EN
TZID:Europe/Paris
X-WR-TIMEZONE:Europe/Paris
BEGIN:VEVENT
UID:7906@i2m.univ-amu.fr
DTSTART;TZID=Europe/Paris:20160204T110000
DTEND;TZID=Europe/Paris:20160204T120000
DTSTAMP:20241120T205602Z
URL:https://www.i2m.univ-amu.fr/evenements/logics-for-weighted-automata-an
 d-transducers/
SUMMARY:Benjamin Monmege (LIF\, Aix-Marseille Université): Logics for Weig
 hted Automata and Transducers
DESCRIPTION:Benjamin Monmege: SÉMINAIRE COMMUN I2M (LDP) - LIF (MOVE)\n\n\
 nThis talk will present some of the recent results obtained in the communi
 ty on the relationship between weighted automata and weighted logics. The 
 story started 10 years ago with the introduction of a quantitative semanti
 cs for MSO logic over words and an equivalence theorem between weighted au
 tomata and a restricted weighted MSO logic. Since then\, many extensions h
 ave been studied: from words to trees\, infinite words\, pictures\, etc\; 
 from semirings to more general weight computations. Also\, the proof techn
 iques have matured\, from low level\, carefully mimicking the classical pr
 oofs in the boolean setting\, to higher level\, using various abstract sem
 antics. We illustrate this evolution by introducing a core weighted logic 
 and its abstract semantics as multisets of weight structures. The equivale
 nce between weighted automata and core weighted logic holds at the level o
 f the abstract semantics. We will also demonstrate the versatility of the 
 weighted automata approach by instantiating it into the transducer setting
 \, showing a possible lead towards the design of an alternative logic for 
 transductions.\n\n
ATTACH;FMTTYPE=image/jpeg:https://www.i2m.univ-amu.fr/wp-content/uploads/2
 020/01/Benjamin_Monmege.jpg
CATEGORIES:Séminaire,Logique et Interactions
END:VEVENT
BEGIN:VTIMEZONE
TZID:Europe/Paris
X-LIC-LOCATION:Europe/Paris
BEGIN:STANDARD
DTSTART:20151025T020000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
END:STANDARD
END:VTIMEZONE
END:VCALENDAR