## Bi-rewrite systems (1996)

by
Jordi Levy
,
Jaume Agusti

Citations: | 29 - 9 self |

### BibTeX

@MISC{Levy96bi-rewritesystems,

author = {Jordi Levy and Jaume Agusti},

title = {Bi-rewrite systems},

year = {1996}

}

### OpenURL

### Abstract

In this article we propose an extension of term rewriting techniques to automate the deduction in monotone pre-order theories. To prove an inclusion a ⊆ b from a given set I of them, we generate from I, using a completion procedure, a bi-rewrite system 〈R⊆, R⊇〉, that is, a pair of rewrite relations −−− → R ⊆ and −−− → R ⊇ , and seek a common term c such that a −−−→ R ⊆ c and b −−−→