Program

October 19th

9:00-10:30 Session 1
Invited Speaker Jan Křetínský: Learning and Guessing Winning Policies in LTL Synthesis via Semantics
Aniello Murano: Playing Quantitative Games Against an Authority: On the Module Checking Problem
Giuseppe Perelli: Endogenous Energy Reactive Modules Games: Modelling Side Payments Among Resource-Bounded Agents
Gianmarco Parretti: Computational Foundations of Responsibility Based on LTLf Reactive Synthesis
10:30-11:00 Break
11:00-12:30 Session 2
Invited Speaker Augusto B. Corrêa: Lifted Planning: Recent Advances in Planning Using First-Order Representations
Bernhard Nebel: The Computational Complexity of Multi-Agent Pathfinding on Directed Graphs
Mikhail Soutchanski: Heuristic Planning for Hybrid Dynamical Systems
Luigi Bonassi: Dealing with Numeric and Metric Time Constraints in PDDL3 via Compilation to Numeric Planning
12:30-14:00 Lunch Break
14:00-15:30 Session 3
Invited Speaker Suguman Bansal: Trustworthy Generalizable RL
Sao Mai Nguyen: Online Learning a Symbolic Abstraction of Actions in Hierarchical RL with Formal Methods
Alexander McCaffrey: CoPRIME: Compression Progress Rewards for Intrinsically Motivated Exploration
Xiangyu Zhao: Prompt Recursive Search: A Living Framework with Adaptive Growth in LLM Auto-Prompting
15:30-16:00 Break
16:00-17:30 Session 4
Alejandro Fernández Alburquerque: Parallel Strategies for Best-First Generalized Planning
Oleksandr Firsov: Optiplan: An Efficient CSP Encoding for Hybrid HTN Planning
Gianmarco Parretti: Synthesis with Multiple Specifications
Marco Montali: Foundations of Reactive Synthesis for Declarative Process Specifications
Przemysław Wałęga: Materialisation In Rule-Based Temporal Languages
Matteo Mancanelli: Situation Calculus Temporally Lifted Abstractions for Program Synthesis