Bi-Rewrite Systems

  title={Bi-Rewrite Systems},
  author={Jordi Levy and Jaume Agust{\'i}-Cullell},
  journal={J. Symb. Comput.},
In this article we propose an extension of term rewriting techniques to automate the deduction in monotone pre-order theories. To prove an inclusionabfrom a given setIof them, we generate fromI, using a completion procedure, abi-rewrite system, that is, a pair of rewrite relations and , and seek a common termcsuch thatacandbc. Each component of the bi-rewrite system and is allowed to be a subset of the corresponding inclusion relation or defined by the theory ofI. In order to assure the… 

Structures for Abstract Rewriting

This paper investigates an abstract form of rewriting, by following the paradigm of logical-system independency, and introduces convergent rewrite systems that enable one to describe deduction procedures for their corresponding theory, and proposes a Knuth-Bendix–style completion procedure.

Bi-rewriting rewriting logic

Rewriting logic as a logic of special relations

An Abstract Way to Define Rewriting Logic

Term Rewriting in a Logic of Special Relations

It is shown that by applying rewrite techniques to logical theories considered as instances of a general 'logic of special relations' the authors can unify and hence simplify the computational analysis within these theories.

Context Unification and Traversal Equations

This paper proves that, if the so called rank-bound conjecture is true, then the context unification problem is decidable, and reduces context unification to solvability of traversal equations and then to word equations with regular constraints.

Deciding Context Unification

The technique is generalized to trees, and the corresponding algorithm is generalized from word equations to context unification, which shows that context unification is in PSPACE (in EXPTIME , when tree regular constraints are also allowed).

Abstract rewriting logic parameterized by a formal system

This work will show that there exists a valid and useful notion of rewriting logic associated to any rewriting theory fitting an abstract framework developed by two of the authors in previous papers, and study the transformation that from the equational logic has resulted in the rewriting logic.

On some variants of second-order unification

The main result of this thesis is the definition of a non-trivial sufficient and necessary condition on the unifiers, for the decidability of Context Unification, called rank-bound conjecture.

On a Generalised Logicality Theorem

It is shown that the convertibility relation obtained via semi-commutation is equivalent to the inference relation of the logic under consideration, which is logic-independent.



Rewrite Systems

  • N. DershowitzJ. Jouannaud
  • Computer Science
    Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics
  • 1990

Confluent and Coherent Equational Term Rewriting Systems: Application to Proofs in Abstract Data Types

It is shown that two abstract properties, namely E-confluence and E-coherence are both necessary and sufficient ones to compute with these models and can be checked on critical pairs yielding Huet's classical results on “confluence modulo”.

Completion of a set of rules modulo a set of equations

The Church–Rosser property is proved decidable for a very general reduction relation which may take into account the left-linearity of rules for efficiency reasons, under the only assumption of existence of a complete and finite unification algorithm for the underlying equational theory, whose congruence classes are assumed to be finite.

Relational Algebra and Equational Proofs

  • E. Kogel
  • Mathematics
    Fundam. Informaticae
  • 1995
A proposal is made for a formal framework in which equational provability can be represented and investigated and it is shown that provability of an equation from a finite set of equations, where all equations are variable-free, is decidable.

Term rewriting systems: a tutorial

This tutorial introduces some of the basic concepts and facts for TRSs, and an emphasis is put on Abstract Reduction Systems, of which not only T RSs are instances, but also Semi-Thue Systems, tree replacement systems, graph rewrite systems.

Higher-order critical pairs

  • T. Nipkow
  • Computer Science
    [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science
  • 1991
The notion of critical pair is generalized to higher-order rewrite systems, and the analog of the critical pair lemma is proved.

A unification algorithm for second-order monadic terms

  • W. Farmer
  • Computer Science
    Ann. Pure Appl. Log.
  • 1988

Rewrite techniques for transitive relations

It is demonstrated that rewrite techniques considerably restrict variable chaining, though it is also shown that they cannot be completely avoided for transitive relations in general.

A Complete Mechanization of Second-Order Type Theory

A generalization of the resolution method for higher order logic is presented and it is established that the author's generalized resolution procedure is complete with respect to a natural notion of validity based on Henkin's general validity for type theory.

Ordered Chaining for Total Orderings

It is shown that variable elimination is an admissible simplification technique within the redundancy framework, and that consequently for dense total orderings without endpoints no variable chaining is needed at all.