Rewriting

Known as: Trace rewriting system, Rewrite rules, Rewrite system 
In mathematics, computer science, and logic, rewriting covers a wide range of (potentially non-deterministic) methods of replacing subterms of a… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1937-2018
020040019372017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2007
Highly Cited
2007
We present the Tom language that extends Java with the purpose of providing high level constructs inspired by the rewriting… (More)
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Techniques for efficiently evaluating future time Linear Temporal Logic (abbreviated LTL) formulae on finite execution traces are… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Maude is a high-level language and a high-performance system supporting executable speci$cation and declarative programming in… (More)
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Context-sensitive rewriting is a simple rewriting restriction which is formalized by imposing fixed restrictions on replacements… (More)
Is this relevant?
Highly Cited
2000
Highly Cited
2000
We present techniques to prove termination and innermost termination of term rewriting systems automatically. In contrast to… (More)
Is this relevant?
Highly Cited
1999
Highly Cited
1999
We investigate the problem of rewriting queries with aggregate operators using views that may or may not contain aggregate… (More)
  • table 1
  • table 2
  • table 3
  • table 4
Is this relevant?
Highly Cited
1999
Highly Cited
1999
We address the problem of query rewriting for TSL, a language for querying semistructured data. We develop and present an… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1997
Highly Cited
1997
The problem of rewriting queries using views is to iind a query expression that uses only a set of views V and is equivalent to… (More)
Is this relevant?
Highly Cited
1990
Highly Cited
1990
An induction method called term rewriting induction is proposed for proving properties of term rewriting systems. It is shown… (More)
Is this relevant?
Highly Cited
1980
Highly Cited
1980
This paper gives new results, and presents old ones m a umfied formahsm, concerning ChurchRosser theorems for rewrmng systems… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 7
Is this relevant?