ILLC-LIRa

illc-lira@list.uva.nl

1 participants
582 discussions

LIRa session: Dazhu Li (unusual time)
by LIRa Seminar 22 Jan '20

22 Jan '20

Dear all, Tomorrow we will have our next LIRa session. Please, find the details below: Speaker: Dazhu Li Date and Time: Thursday, January 23rd 2020, 17:00-18:30 (Note the unusual starting time) Venue: ILLC Seminar Room F1.15, Science Park 107. Title: On the Right Path: A Modal Logic for Supervised Learning. Abstract. Formal learning theory formalizes the process of inferring a general result from examples, as in the case of inferring grammars from sentences when learning a language. Although empirical evidence suggests that children can learn a language without responding to the correction of linguistic mistakes, the importance of Teacher in many other paradigms is significant. Instead of focusing only on learner(s), this work develops a general framework --- supervised learning game (SLG) --- to investigate the interaction between Teacher and Learner. In particular, our proposal highlights several interesting features of the agents: on the one hand, Learner may make mistakes in the process of learning, and she may also ignore the potential relation between different hypotheses; on the other hand, Teacher is able to correct Learner\'s mistakes, eliminate Learner\'s mistakes and point out the facts ignored by Learner. To reason about strategies in this game, we develop a modal logic of supervised learning (SLL), and study its properties. Broadly, this work takes a small step toward studying the interaction between graph games, logics and formal learning theory. Hope to see you there! The LIRa team

1 0

LIRa session: Dazhu Li (unusual time)
by LIRa Seminar 17 Jan '20

17 Jan '20

Dear all, LIRa is back! We will have our first talk for 2020 on Thursday, January 23rd. Our speaker is Dazhu Li and you may find the details below: Speaker: Dazhu Li Date and Time: Thursday, January 23rd 2020, 17:00-18:30 (Note the unusual starting time) Venue: ILLC Seminar Room F1.15, Science Park 107. Title: On the Right Path: A Modal Logic for Supervised Learning. Abstract. Formal learning theory formalizes the process of inferring a general result from examples, as in the case of inferring grammars from sentences when learning a language. Although empirical evidence suggests that children can learn a language without responding to the correction of linguistic mistakes, the importance of Teacher in many other paradigms is significant. Instead of focusing only on learner(s), this work develops a general framework --- supervised learning game (SLG) --- to investigate the interaction between Teacher and Learner. In particular, our proposal highlights several interesting features of the agents: on the one hand, Learner may make mistakes in the process of learning, and she may also ignore the potential relation between different hypotheses; on the other hand, Teacher is able to correct Learner\'s mistakes, eliminate Learner\'s mistakes and point out the facts ignored by Learner. To reason about strategies in this game, we develop a modal logic of supervised learning (SLL), and study its properties. Broadly, this work takes a small step toward studying the interaction between graph games, logics and formal learning theory. Hope to see you there! The LIRa team

1 0

CFP: ECAI2020 workshop NETREASON
by LIRa Seminar 24 Dec '19

24 Dec '19

Dear all, Below you can find a call for papers by the ECAI2020 workshop NETREASON: reasoning about social networks. The call is for scientific papers, which report novel research in the areas (but not limited to): Logic based models of social networks phenomena Epistemic models on graphs Strategic behaviour in opinion diffusion Computational issues in opinion diffusion Computational Trust Collective information distortions and how to prevent them Model checking and verification of social network phenomena The submission deadline is February 28, 2020. Details of the workshop and submission instructions can be found: https://netreason.w.uib.no/ ECAI 2020 will be held at Santiago de Compostela 10-12 June 2020 and the collocated workshops will be held before the conference 8-9 June 2020. Hope to see you there! The LIRa team

1 0

CFP: ECAI2020 workshop NETREASON
by LIRa Seminar 24 Dec '19

24 Dec '19

Dear all, We forward the CFP by the ECAI2020 workshop NETREASON: reasoning about social networks. As you can see, it might be of interest for many LIRa members. The call is for scientific papers, which report novel research in the areas (but not limited to): Logic based models of social networks phenomena Epistemic models on graphs Strategic behaviour in opinion diffusion Computational issues in opinion diffusion Computational Trust Collective information distortions and how to prevent them Model checking and verification of social network phenomena The submission deadline is February 28, 2020. Details of the workshop and submission instructions can be found: https://netreason.w.uib.no/ ECAI 2020 will be held at Santiago de Compostela 10-12 June 2020 and the collocated workshops will be held before the conference 8-9 June 2020. The LIRa team

1 0

CFP: ECAI2020 workshop NETREASON
by LIRa Seminar 23 Dec '19

23 Dec '19

Dear all, We forward the call for papers by the ECAI2020 workshop NETREASON: reasoning about social networks. As you can see, it might of interest for many LIRa members. The call is for scientific papers, which report novel research in the areas (but not limited to): Logic based models of social networks phenomena Epistemic models on graphs Strategic behaviour in opinion diffusion Computational issues in opinion diffusion Computational Trust Collective information distortions and how to prevent them Model checking and verification of social network phenomena The submission deadline is February 28, 2020. Details of the workshop and submission instructions can be found: https://netreason.w.uib.no/ ECAI 2020 will be held at Santiago de Compostela 10-12 June 2020 and the collocated workshops will be held before the conference 8-9 June 2020. The LIRa team

1 0

CFP: ECAI2020 workshop NETREASON
by LIRa Seminar 23 Dec '19

23 Dec '19

1 0

CFP: ECAI2020 workshop NETREASON
by LIRa Seminar 23 Dec '19

23 Dec '19

1 0

LIRa Session: Hans van Ditmarsch
by LIRa Seminar 11 Dec '19

11 Dec '19

Dear all, Tomorrow we will have our next LIRa session. Please, find the details below: Speaker: Hans van Ditmarsch (CNRS, LORIA) Date and Time: Thursday, December 12th 2019, 16:30-18:00 Venue: ILLC Seminar Room F1.15, Science Park 107. Title: Dynamic epistemic logic for distributed computing - asynchrony and concurrency. Abstract. We will present some recent work on asynchrony and concurrency in dynamic epistemic logics (DEL), building on foundations in distributed computing and temporal epistemic logics. Asynchrony can be modelled by reasoning over histories of actions of different length. How to do this in DEL was proposed by [Dégremont, Löwe, Witzel: TARK 2011]. By equivalence relations on protocol-generated forests along different depths of trees, they can identify action histories of different length. More or less strongly related to DEL this was also considered for: gossip protocols [Apt, Grossi, vd Hoek, TARK 2015], logic puzzles [vD, van Eijck, Wu: KR 2010], and for the immediate snapshot algorithm in distributed computing [Goubault, Ledent, Rajsbaum: GandALF 2018]. We will present the last in some detail: Kripke models and action models can be represented as simplicial complexes. Dynamic epistemic logic can then be interpreted on such complexes. From the perspective of dynamic epistemic logic, a further departure towards distributed computing and asynchrony is to distinguish the sending and receiving of messages, such as the making versus hearing of announcements. Recent proposals are [Knight, Maubert, Schwarzentruber; MSCS 2019] and [Balbiani, vD, Fernandez Gonzalez; ArXiV 2019] (SR 2017). From the latter we will present asynchronous announcement logic. Its axiomatization resembles that of public announcement logic, and the dynamic modalities can also be eliminated. Further research is on (what is known as) concurrent common knowledge. Finally, how do we model concurrency in DEL? Both true concurrency and intersection concurrency are conceivable. We recall some older work in the area: [vD, vd Hoek, Kooi: AAMAS 2003] and [van Eijck, Sietsma, Wang: JANCL 2011]. The Muddy Children Problem is a joy forever: the action of three muddy children not stepping forward because none of them know whether they are muddy, is always modelled as the public announcement of a conjunction with three conjuncts. Should this not be a concurrent action with three components?. Hope to see you there! The LIRa team

1 0

LIRa Session: Hans van Ditmarsch
by LIRa Seminar 06 Dec '19

06 Dec '19

Dear all, We will have our next session on Thursday, December 12th. Our speaker is Hans van Ditmarsch, and you can find the details of the talk below: Speaker: Hans van Ditmarsch (CNRS, LORIA) Date and Time: Thursday, December 12th 2019, 16:30-18:00 Venue: ILLC Seminar Room F1.15, Science Park 107. Title: Dynamic epistemic logic for distributed computing - asynchrony and concurrency. Abstract. We will present some recent work on asynchrony and concurrency in dynamic epistemic logics (DEL), building on foundations in distributed computing and temporal epistemic logics. Asynchrony can be modelled by reasoning over histories of actions of different length. How to do this in DEL was proposed by [Dégremont, Löwe, Witzel: TARK 2011]. By equivalence relations on protocol-generated forests along different depths of trees, they can identify action histories of different length. More or less strongly related to DEL this was also considered for: gossip protocols [Apt, Grossi, vd Hoek, TARK 2015], logic puzzles [vD, van Eijck, Wu: KR 2010], and for the immediate snapshot algorithm in distributed computing [Goubault, Ledent, Rajsbaum: GandALF 2018]. We will present the last in some detail: Kripke models and action models can be represented as simplicial complexes. Dynamic epistemic logic can then be interpreted on such complexes. From the perspective of dynamic epistemic logic, a further departure towards distributed computing and asynchrony is to distinguish the sending and receiving of messages, such as the making versus hearing of announcements. Recent proposals are [Knight, Maubert, Schwarzentruber; MSCS 2019] and [Balbiani, vD, Fernandez Gonzalez; ArXiV 2019] (SR 2017). From the latter we will present asynchronous announcement logic. Its axiomatization resembles that of public announcement logic, and the dynamic modalities can also be eliminated. Further research is on (what is known as) concurrent common knowledge. Finally, how do we model concurrency in DEL? Both true concurrency and intersection concurrency are conceivable. We recall some older work in the area: [vD, vd Hoek, Kooi: AAMAS 2003] and [van Eijck, Sietsma, Wang: JANCL 2011]. The Muddy Children Problem is a joy forever: the action of three muddy children not stepping forward because none of them know whether they are muddy, is always modelled as the public announcement of a conjunction with three conjuncts. Should this not be a concurrent action with three components?. Hope to see you there! The LIRa team

1 0

CANCELLED LIRa session: Michael Mäs
by LIRa Seminar 04 Dec '19

04 Dec '19

Dear all, Unfortunately, our speaker Michael Mäs had to cancel the talk scheduled for tomorrow due to personal reasons. We will try to reschedule the talk and keep you posted. The LIRa team

1 0

← Newer
1
...
31
32
33
34
35
36
37
...
59
Older →

Jump to page:

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

ILLC-LIRa