Thursday, June 16, 2005
|
|
07:30-09:00
|
breakfast
|
|
Chair: Moshe Y. Vardi
|
|
09:00-09:45
| |
Piergiorgio Bertoli (IRST - Trento)
| |
Planning for Partially Observable, Non-Deterministic Domains
|
|
|
09:45-10:30
| |
Bart Selman (Cornell University)
| |
Why SAT Works and QBF (Often) Doesn't
|
|
|
10:30-11:00
| coffee break |
|
11:00-11:40
| |
Martin Leucker (Technical University of Munich)
| |
Controller Synthesis for Probabilistic Systems
|
|
|
11:40-12:20
| |
Kousha Etessami (University of Edinburgh)
|
Analysis of Recursive Markov Chains, Recursive Markov
Decision Processes, and Recursive Stochastic Games
|
|
|
12:20-14:00
| lunch break |
|
Chair: Henry Kautz
|
|
14:00-14:45
| |
Rupak Majumdar (UCLA)
| |
Counterexample Guided Synthesis
|
|
|
14:45-15:30
| |
Stefan Edekkamp (University of Dortmund)
| |
External Heuristic Search for Model Checking and Planning Practice
|
|
|
15:30-16:00
| coffee break |
|
16:00-16:40
| |
Robert P. Goldman (SIFT)
| |
Planning and Controller Synthesis with Timed Automata
|
|
|
16:40-17:20
| |
Alfonso Gerevini (University of Brescia)
| |
Fully Automated Temporal Planning
|
|
|
17:40-18:00
| |
Sergei Vorobyov (University of Uppsala)
| |
Infinite Games and Linear Programming
|
|
|
18:00-20:00
| dinner |
|
20:00-22:00
|
Panel Discussion:
Giuseppe De Giacomo,
Robert P. Goldman,
Stephane Lafortune,
Oded Maler,
Amir Pnueli
-
What did I learn here?
-
What do the different areas have to offer each other?
|
|