Program (tentative)
February 23
| 14:00 – 15:30 | Session 1 (chair: N. Nishida) |
14:00|
Lexicographic Path Orders with Multiple Precedences |
Nao Hirokawa and Ziyu Guo JAIST |
14:30|
Merging Rewriting Induction and Circular Coinduction |
Takahito Aoto Niigata U. |
15:00|
Composable Confluence Criteria |
Kiraku Shintani JAIST |
| 15:30 – 16:30 | Break |
| 16:30 – 18:00 | Session 2 (chair: A. Yamada) |
16:30|
Maximal Ordered Completion with Inter-reduction |
Teppei Saito JAIST |
17:00|
On Transforming Inductive Definition Sets into Term Rewrite Systems |
Shujun Zhang Nagoya U. |
17:30|
Business Meeting |
|
February 24
| 10:00 – 11:30 | Session 3 (chair: A. Middeldorp) |
10:00|
Solving quadratic Diophantine equations (Survey) |
Mizuhito Ogawa JAIST |
10:30|
Interpretation Orders for Applicative Term Rewrite Systems |
Teppei Tanaka JAIST |
11:00|
Flat Rational Term Rewriting Revisited |
Munehiro Iwami Shimane U. |
| 11:30 – 13:00 | Lunch Break |
| 13:00 – 14:30 | Session 4 (chair: N. Hirokawa) |
13:00|
Incremental Polynomial Termination over N is Undecidable |
Aart Middeldorp U. Innsbruck / Nagoya U. |
13:45|
Term Ordering for Non-Reachability of (Conditional) Rewriting |
Akihisa Yamada AIST |
| 14:30 – 15:30 | Break |
| 15:30 – 16:30 | Session 5 (chair: T. Aoto) |
15:30|
Equivalence of Context-Free and Regular Languages on Commutative Strings |
Masahiko Sakai Nagoya U. |
16:00|
On Semantically Equivalent Operations for Inversion of DCTRSs |
Naoki Nishida Nagoya U. |
February 25
| 9:30 – 11:45 | Free Discussion |
| 11:45 – 12:00 | Closing |