AJSW 2016
4th Austria - Japan Summer Workshop on Term Rewriting
8 – 9 September 2016, Obergurgl, AustriaAJSW is an informal workshop for researchers in Austria and Japan and aims to facilitate and share new developments and ideas in term rewriting. Not only presentations about published results but also work-in-progress talks are welcome.
(See also the official announcement.)
The event is held as part of CLA 2016 and also identified as the 45th TRS Meeting. Previous editions of the workshop were held in Obergurgl (2010), Obergurgl (2007), and Obergurgl (2005).
News
- 2016-08-18: A preliminary program is now online.
- 2016-07-04: Registration is open.
Timeline
- September 7 (Wed)
- excursion of CLA
- September 8 (Thu)
- first day of workshop
- September 9 (Fri)
- second day of workshop
- September 10 (Sat)
- leaving day
Program
8th (Thu)
1st session
- 11:15 - 11:35
-
Lazy Evaluation Schemes for Efficient Implementations of Multi-Context
Algebraic Reasoning Systems
ChengCheng Ji & Masahito Kurihara - 11:35 - 11:55
-
Proving Inductive Validity of Constrained Inequalities
Takahiro Nagao - 11:55 - 12:15
-
Heuristics for Proving Termination of Constrained Rewriting Systems via
Rule Duplication
Naoki Nishida - 12:15 - 12:35
-
Operational Termination of Conditional Term Rewriting Systems
Thomas Sternagel2nd session
- 16:25 - 16:45
-
Analysing GHC Rewrite Rules
Julian Nagele - 16:45 - 17:05
-
Abstract Completion Revisited 1
Aart Middeldorp - 17:05 - 17:25
-
Abstract Completion Revisited 2
Nao Hirokawa - 17:25 - 17:45
-
Mechanized AC-Equivalence Checking in Isabelle/HOL
Christian Sternagel - 17:45 - 18:05
-
Confluence and Higher-Order Critical-Pair-Closing Systems
Vincent van Oostrom
9th (Fri)
3rd session
- 11:15 - 11:35
-
Undecidability of Satisfiability in the First-Order Theory of
Rewriting
Bertram Felgenhauer - 11:35 - 11:55
-
Programming in the Esoteric Language Malbolge for Obfuscation
Masahiko Sakai - 11:55 - 12:15
-
Anti-Unification Algorithm Library and Applications
Cleopatra Pau - 12:15 - 12:35
-
Semantics and Completeness Proof of General Inductive Theorems
Takahito Aoto4th session
- 16:25 - 16:45
-
Reachability for Termination
Akihisa Yamada - 16:45 - 17:05
-
Confluence of Innermost Reduction is Undecidable for Terminating TRSs
Michio Oyamaguchi - 17:05 - 17:25
-
Termination of TRS Synthesis by Rewriting Induction
Yoshihito Toyama - 17:25 - 17:45
-
Computing Generalizations in Description Logic EL
Temur Kutsia - 17:45
-
Business Meeting
Participants
- Takahito Aoto (Niigata University)
- Bertram Felgenhauer (University of Innsbruck)
- Nao Hirokawa (JAIST)
- ChengCheng Ji (Hokkaido University)
- Masahito Kurihara (Hokkaido University)
- Temur Kutsia (RISC, Johannes Kepler University Linz)
- Aart Middeldorp (University of Innsbruck)
- Takahiro Nagao (Nagoya University)
- Julian Nagele (University of Innsbruck)
- Naoki Nishida (Nagoya University)
- Vincent van Oostrom (University of Innsbruck)
- Michio Oyamaguchi (Nagoya University)
- Cleopatra Pau (RISC, Johannes Kepler University Linz)
- Masahiko Sakai (Nagoya University)
- Christian Sternagel (University of Innsbruck)
- Thomas Sternagel (University of Innsbruck)
- Yoshihito Toyama (Tohoku University)
- Akihisa Yamada (University of Innsbruck)
Organizers
- Christian Sternagel (University of Innsbruck)
- Nao Hirokawa (JAIST)