Conference Programme

5 January 2017
8:30 Registration
Invited Talk
9:30 - 10:30 Natasha Dobrinen
Ramsey Theory on Trees and Applications
10:30 - 11:00 Coffee
11:00 - 12:30 Contributed Talks
Ramanathan S. Thinniyam
Definability of Recursive Predicates in the Induced Subgraph Order
Arun Kumar and Mohua Banerjee
A Semantic Analysis of Stone and dual Stone Negations with Regularity
Zeinab Bakhtiari, Hans van Ditmarsch and Helle Hvid Hansen
Neighbourhood Contingency Bisimulation
12:30 Lunch
14:00 - 15:00 Contributed Talks
Herman Geuvers and Tonny Hurkens
Deriving natural deduction rules from truth tables
Minghui Ma and Ahti-Veikko Pietarinen
Peirce's Sequent Proofs of Distributivity
15:00 - 15:30 Coffee
Invited Talk
15:30 - 16:30 Nicholas Asher
Conversation and Games
16:30 - 17:00 Contributed Talks
Arka Banerjee, Samir Karmakar, Soumya Ghosh, Sayantani Banerjee
Grammar as Graph: A Lexicalist Treatment of Traditional Bangla Grammar
6 January 2017
Invited Talk
9:00 - 10:00 Richard Zach
Semantics and Proof Theory of the Epsilon Calculus
10:00 - 10:30 Coffee
10:30 - 12:30 Contributed Talks
Jan van Eijck, Malvin Gattinger and Yanjing Wang
Knowing Values and Public Inspection
Didier Galmiche, Pierre Kimmel and David Pym
A Substructural Epistemic Resource Logic
Yanjun Li and Yanjing Wang
Achieving while maintaining: A logic of knowing how with intermediate constraints
Hidenori Kurokawa and Hirohiko Kushida
Linear Logic with S5 modality
12:30 Lunch
14:00 - 15:00 Contributed Talks
Jeff Paris and Alena Vencovska
Ancient Indian Logic and Analogy
Manidipa Sanyal
Modality in the tradition of nyaya
15:00 - 15:30 Coffee
15:30 - 16:30 Contributed Talks
Ignacio Ojea Quintana
On Semantic Gamification
Anand Pratap Singh and S. P. Tiwari
On study of L-fuzzy transform
17:00 - 18:00 ALI Business Meeting
7 January 2017
Invited Talk
9:00 - 10:00 Luke Ong
Automata, Logic and Games for the Lambda Calculus
10:00 - 10:30 Coffee
10:30 - 12:30 Contributed Talks
Corey Fisher, Moshe Vardi and Seth Fogarty
Random Models for Evaluating Efficient Buchi Universality Checking
Hans Kleine Buning, Piotr Wojciechowski and K. Subramani
The Complexity of Finding Read-Once NAE-Resolution Refutations
Przemyslaw Andrzej Walega
Computational Complexity of a Hybridized Horn Fragment of Halpern-Shoham Logic
Abhishek Kr Singh
Fully Mechanized Proofs of Dilworth's Theorem and Mirsky's Theorem
12:30 - 14:00 Lunch and Closing