Sciweavers

882 search results - page 2 / 177
» A Taste of Rewrite Systems
Sort
View
CORR
2010
Springer
106views Education» more  CORR 2010»
13 years 22 days ago
Deduction as Reduction
Abstract. Deduction systems and graph rewriting systems are compared within a common categorical framework. This leads to an improved deduction method in diagrammatic logics.
Dominique Duval
WADT
2004
Springer
13 years 11 months ago
From Conditional to Unconditional Rewriting
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...
Grigore Rosu
ENTCS
2008
89views more  ENTCS 2008»
13 years 5 months ago
Undecidable Properties on Length-Two String Rewriting Systems
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...
Masahiko Sakai, Yi Wang
LOPSTR
2004
Springer
13 years 11 months ago
Natural Rewriting for General Term Rewriting Systems
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...
Santiago Escobar, José Meseguer, Prasanna T...
ICIP
2002
IEEE
14 years 7 months ago
TAST-Trademark Application Assistant
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...