Congruences Generated by Extended Ground Term Rewrite Systems

Authors:
Sándor Vágvölgyi
Affiliations:
Department of Foundations of Computer Science, University of Szeged, Hungary. E-mail: vagvolgy@inf.u-szeged.hu
Venue:
Fundamenta Informaticae
Year:
2009

Citing 8
Cited 0

Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems

Information and Computation
A fast algorithm for generating reduced ground rewriting systems from a set of ground equations

Journal of Symbolic Computation
Basic paramodulation

Information and Computation
Term rewriting and all that

Term rewriting and all that
Derivation trees of ground term rewriting systems

Information and Computation
Restricted ground tree transducers

Theoretical Computer Science
Decidability of confluence for ground term rewriting systems

FCT '85 Fundamentals of Computation Theory
Term rewriting restricted to ground terms

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that it is decidable for any extended ground term rewrite system R whether there is a ground term rewrite system S such that the congrunce ↔$^*_R$ generated by R is equal to the congruence ↔$^*_S$ generated by S. If the answer is yes, then we can effectively construct such a ground term rewrite system S. We characterize congruences generated by extended ground term rewrite systems.