|
Logical Models of Reasoning and Computation
Steklov Mathematical Institute
February 1-3, 2012
Preliminary Timetable
Wednesday, February 1. Conference hall, 9-th floor
- 9:00–10:00
- Registration and Coffee
- 10:00–10:45
- Yuri Gurevich. Distributed Knowledge Authorization Language (DKAL). Managing Policies and Trust
- 10:45–11:30
- Hans van Ditmarsch. Dynamic Epistemic Logic
- 11:30–12:00
- Coffee
- 12:00–12:45
- Nikolaj Bjorner. Z3 - An Efficient Satisfiability Modulo Theories solver: Foundations and Applications
- 12:45–13:30
- Roman Kuznets. Realizing Public Announcements by Justifications
- 13:30–15:30
- Lunch
- 15:30–16:15
- Sergei Adian. On a method of proving exact bounds on derivational complexity in length preserving Thue systems
- 16:15–17:00
- Matthias Baaz. Epsilon theorems and non-classical logics
- 17:00–17:30
- Coffee
- 17:30–18:15
- Thomas Strahm. Types and truth in weak applicative theories
- 18:15
- Welcome drink
Thursday, February 2. Conference Hall, 9-th Floor
- 9:30–10:00
- Coffee
- 10:00–10:45
- Andreas Blass and Yuri Gurevich. What is the intrinsic logic of infons?
- 10:45–11:30
- Max Kanovich. How and Why Separation Logic is an exact fit for Resource Reasoning about Programs
- 11:30–12:00
- Coffee
- 12:00–12:45
- Nikolaj Bjorner. Solving Fixed-points with Theories: From program logics, to logic programs, to logic engines.
- 12:45–13:30
- Nikolay Vereshchagin. On abstract resource semantics and computabilty logic
- 13:30–15:30
- Lunch
- 15:30–16:15
- Michael Zakharyaschev. On ontology-based data access
- 16:15–17:00
- Evgeny Zolin. Graded Dependent Modal Logics
- 17:00–17:30
- Coffee
- 17:30–18:15
- Mikhail Volkov. P(l)aying for synchronization
Friday, February 3. Conference Hall, 9-th Floor
- 9:30–10:00
- Coffee
- 10:00–10:45
- Agata Ciabattoni. Nonclassical Proofs: theory, applications, and tools
- 10:45–11:30
- Daniel Weller. Deskolemization, Equality and Logical Complexity
- 11:30–12:00
- Coffee
- 12:00–12:45
- Nachum Dershowitz. Canonical Inference
- 12:45–13:30
- Aleksei Semenov, Sergei Soprunov. The Lattice of Relational Algebras Definable in Integers with
Successor
- 13:30–15:30
- Lunch
- 15:30–16:15
- Stepan Kuznetsov. Grammars based on variants of the Lambek calculus
- 16:15–17:00
- Tatiana Yavorskaya. First order logic of proofs
- 17:00–17:30
- Coffee
- 17:30–18:15
- Anna Zamansky. Modular Construction of Cut-free Calculi for Paraconsistent Logics
- 18:15–18:25
- Closing and Reception
|