Abstract. Deduction systems and graph rewriting systems are compared within a common categorical framework. This leads to an improved deduction method in diagrammatic logics.
An automated technique to translate conditional rewrite rules into unconditional ones is presented, which is suitable to implement, or compile, conditional rewriting on top of much...
Length-two string rewriting systems are length preserving string rewriting systems that consist of length-two rules. This paper shows that both of termination and confluence for l...
We address the problem of an efficient rewriting strategy for general term rewriting systems. Several strategies have been proposed over the last two decades for rewriting, the mos...
In this paper, we introduce a novel Trademark Application Assistant (TAST) that aims to speed up the process of a successful trademark application. The core of TAST is a web-brows...
Paul Wing Hing Kwan, Kazuo Toraichi, Keisuke Kamey...