Schedule

Friday, January 2

8 – 10pm
Welcoming reception at a nearby restaurant “JB’s on the beach” 300 North Ocean Blvd

Saturday, January 3

8:00
Registration table opens
8:45 – 9:00
Welcoming remarks
9:00 – 10:00
Invited talk. Max Kanovich & Andre Scedrov. Collaborative Planning with Confidentiality
10:00 – 10:30
Wojciech Moczydlowski. Unifying Sets and Programs via Dependent Types
10:30 – 11:00
Robert Lubarsky. Topological Forcing Semantics with Settling
11 – 11:30
Coffee break
11:30 – 12:00
Max Kanovich. Light Linear Logic with Controlled Weakening: A Missing Opportunity
12:00 – 12:30
Sebastiaan Terwijn. Decidability and undecidability in probability logic
12:30 – 2:30
Lunch
2:30 – 3:00
Sam Buss and Roman Kuznets. The NP-Completeness of Reflected Fragments of Justification Logics
3:00 – 3:30
Eduardo Bonelli and Federico Feller. The Logic of Proofs as a Foundation for Certifying Mobile Computation
3:30 – 4:00
Robert Milnikel. Conservativity for Logics of Justified Belief
4 – 4:30
Coffee break
4:30 – 5:00
Hidenori Kurokawa. Tableaux and Hypersequents for Justification Logic
5:00 – 5:30
Yury Savateev. Product-free Lambek Calculus is NP-complete

Sunday, January 4

9:00 – 9:30
Phiniki Stouppa and Thomas Studer. Data Privacy for ALC Knowledge Bases
9:30 – 10:00
Amelie Gheerbrant and Balder ten Cate. Complete axiomatizations of MSO, FO(TC1) and FO(LFP1) on finite trees
10:00 – 10:30
Stefan Hetzl, Alexander Leitsch, Daniel Weller and Bruno Woltzenlogel Paleo. A Clausal Approach to Proof Analysis in Second-Order Logic
10:30 – 11:00
Jakub Kozik and Antoine Genitrini. Quantitative comparison of Intuitionistic and Classical logics – full propositional system
12:00 – 5:30
Bus+boat cruise from Port Everglades
7:00 – 8:30
Panel discussion “Issues in Logical Foundations of Computer Science.” Chair: Anil Nerode. Panelists: Sergei Artemov, Max Kanovich, Andre Scedrov, Jeff Remmel, Sam Buss.
8:30 – 10:00
Panel discussion “Justification Logic and Applications.” Chair: Sergei Artemov. Panelists: Evangelia Antonakos, Eduardo Bonelli, Sam Buss, Evan Goris, Rosalie Iemhoff, Robert Milnikel, Elena Nogina, Ren-June Wang.

Monday, January 5

9:00 – 10:00
Invited talk. Sam Buss. Proof Complexity and Proof Search: Towards NP-P
10:00 – 10:30
Victor Marek and Jeffrey Remmel. Automata and Answer Set Programming
10:30 – 11:00
Nicolas Bedon. Logic and bounded-width rational languages of posets over countable scattered linear orderings
11:00 – 11:30
Coffee break
11:30 – 12:00
James Worthington. A Bialgebraic Approach to Automata and Formal Language Theory
12:00 – 12:30
Stefano Aguzzoli, Simone Bova and Vincenzo Marra. Applications of finite duality to locally finite varieties of BL-algebras
12:30 – 1:00
Renata de Freitas, Sheila Veloso, Paulo Veloso and Petrucio Viana. Positive Fork Graph Calculus
1:00 – 2:30
Lunch
2:30 – 3:00
Elisabetta De Maria, Angelo Montanari and Nicola Vitacolonna. Games on strings with a limited order relation
3:00 – 3:30
Rosalie Iemhoff and George Metcalfe. Hypersequent Systems for the Admissible Rules of Modal and Intermediate Logics
3:30 – 4:00
Carlos Areces, Santiago Figueira and Sergio Mera. Completeness Results for Memory Logics
4:00 – 4:30
Coffee break
4:30 – 5:00
Thomas Brihaye, Arnaud Da Costa, Francois Laroussinie and Nicolas Markey. ATL with strategy contexts and bounded memory
5:00 – 5:30
Andrea Masini, Luca Vigano and Marco Volpe. A Labeled Natural Deduction System for a Fragment of CTL*
5:30 – 6:00
Pedro Baltazar and Paulo Mateus. Temporalization of probabilistic propositional logic
7:00 – 9:00
Banqueti at a nearby restaurant “Oceans 234” 234 North Ocean Blvd

Tuesday, January 6

9:00 – 9:30
Antonio Bucciarelli, Thomas Ehrhard and Giulio Manzonetto. A relational model of a parallel and non-deterministic lambda calculus
9:30 – 10:00
Ugo Dal Lago, Luca Roversi and Luca Vercelli. Taming Modal Impredicativity: Superlazy Reduction
10:00 – 11:00
LFCS Town Hall Meeting