Nara, April 22, 2005
| 08:30-09:00 | Registration |
| 09:00-10:00 |
Can Proofs be Animated by Games? by Susumu Hayashi (TLCA invited speaker) |
| 10:00-10:30 | Coffee break |
| 10:30-11:00 |
Unification with Expansion Variables by Adam Bakewell, Assaf Kfoury |
| 11:00-11:30 |
R-Unification thanks to Context-Free Synchronized Tree Languages by Pierre Réty, Jacques Chabin, Jing Chen |
| 11:30-12:00 |
Symbolic Debugging in Polynomial Time by Christopher Lynch, Barbara Morawska |
| 12:00-12:30 |
Combining Intruder Theories by Yannick Chevalier, Michaël Rusinowitch |
| 12:30-14:00 | Lunch |
| 14:00-15:00 |
Querying XML documents by tree automata by Joachim Niehren (UNIF invited speaker) |
| 15:00-15:30 |
Can Context Sequence Matching be Used for XML Querying? by Temur Kutsia, Mircea Marin |
| 15:30-16:00 | Coffee break |
| 16:00-16:30 |
Tree vs Dag Automata by Siva Anantharaman, Paliath Narendran, Michaël Rusinowitch |
| 16:30-17:00 |
Relating Nominal and Higher-Order Pattern Unification by James Cheney |
| 17:00-17:30 |
Efficiently Computable Classes of Second Order Predicate Schema Matching Problems by Masateru Harao, Shuping Yin, Keizo Yamada, Kouichi Hirata |
| 17:30-18:30 |
20 Years After OBJ2 Discussion panel (with Kokichi Futatsugi, Joseph Goguen, Jean-Pierre Jouannaud and Jose Meseguer) |