Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Rewrite order

Known as: Reduction ordering, Simplification ordering, Rewrite relation 
In theoretical computer science, in particular in automated theorem proving and term rewriting,a binary relation (→) on the set of terms is called a… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2008
2008
The decreasing diagrams technique is a complete method to reduce confluence of a rewrite relation to local confluence. Whereas… Expand
Is this relevant?
2004
2004
Right-(ground or variable) rewrite systems (RGV systems for short) are term rewrite systems where all right hand sides of rules… Expand
Is this relevant?
2004
2004
Waldmeister is a high-performance theorem prover for unit equational first-order logic. In the making of Waldmeister, we have… Expand
  • table I
  • table II
  • table III
Is this relevant?
2003
2003
We investigate rewriting systems on strings by annotating letters with natural numbers, so called match heights. A position in a… Expand
Is this relevant?
Highly Cited
2002
Highly Cited
2002
  • P. Viry
  • Theor. Comput. Sci.
  • 2002
  • Corpus ID: 45672143
In addition to equations and rules, we introduce equational rules that are oriented while having an equational interpretation… Expand
Is this relevant?
2002
2002
Recently rule based languages focussed on the use of rewriting as a modeling tool which results in making specifications… Expand
Is this relevant?
Highly Cited
1996
Highly Cited
1996
System Description FLOTTER 1 and SPASS 2 are a clause normal form translator for rst-order logic and a theorem prover for rst… Expand
Is this relevant?
Highly Cited
1995
Highly Cited
1995
Recently several researchers have investigated βη-equality for the simply typed λ-calculus with exponentials, products and unit… Expand
Is this relevant?
1995
1995
Existing models for I/O in side-effect free languages focus on functional languages, which are usually based on a largely… Expand
Is this relevant?
Highly Cited
1991
Highly Cited
1991
  • T. Nipkow
  • [] Proceedings Sixth Annual IEEE Symposium on…
  • 1991
  • Corpus ID: 46305939
A subclass of lambda -terms, called patterns, which have unification properties resembling those of first-order terms, is… Expand
Is this relevant?