14:00 -- 14:10 | Opening |
14:10 -- 15:10 |
Path-planning for Multiple Robots
[abstract]
[slide] Pavel Surynek |
15:10 -- 15:30 | Coffee break |
15:30 -- 16:00 |
Using Constraint Satisfaction for Inference-Proofness in Databases Joachim Biskup and Lena Wiese |
16:00 -- 16:30 |
A Preliminary Investigation on Automatic Learning of Probabilistic Planning Rules Domenico Corapi and Katsumi Inoue |
16:30 -- 16:50 | Coffee break |
16:50 -- 17:20 |
Introducing Symmetries in Distributed Constraint Programming Xavier Olive |
18:30 -- 20:30 | Party |
09:30 -- 10:30 |
Global Consistencies in Boolean Satisfiability
[abstract]
[slide] Pavel Surynek |
10:30 -- 10:50 | Coffee break |
10:50 -- 11:20 |
Towards a Compact and Efficient SAT-Encoding of Finite Linear CSP Tomoya Tanjo, Mutsunori Banbara, Naoyuki Tamura |
11:20 -- 11:50 |
Model Tracking for Dynamic SAT with Decision Change Costs Daisuke Hatano, Katsutoshi Hirayama |
11:50 -- 13:30 | Lunch |
13:30 -- 15:00 | Open Discussion |
15:00 | Closing |
Mutsunori Banbara | Kobe University | * |
Gauvain Bourgne | National Institute of Informatics | * |
Domenico Corapi | Imperial College London, UK | * |
Daisuke Hatano | Kobe University | * |
Katsutoshi Hirayama | Kobe University | * |
Kengo Honjo | Kobe University | |
Katsumi Inoue | National Institute of Informatics | * |
Miyuki Koshimura | Kyushu University | * |
Haruki Matsunaka | Kobe University | |
Hedetomo Nabeshima | University of Yamanashi | * |
Xavier Olive | Kyoto University | * |
Takehide Soh | The Graduate University for Advanced Studies | * |
Pavel Surynek | Charles University in Prague | * |
Naoyuki Tamura | Kobe University | * |
Tomoya Tanjo | Kobe University | * |
Lena Wiese | Deutscher Akademischer Austausch Dienst / National Institute of Informatics | * |