Intersection of finitely generated congruences over term algebra

Authors:
Sándor Vágvölgyi
Affiliations:
Department of Applied Informatics, University of Szeged, P.O. Box 652, Árpád tér 2, H-6720 Szeged, Hungary
Venue:
Theoretical Computer Science
Year:
2003

Citing 11
Cited 1

The Church-Rosser property for ground term-rewriting systems is decidable

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

Information and Computation
An algorithm for finding canonical sets of ground rewrite rules in polynomial time

Journal of the ACM (JACM)
A fast algorithm for generating reduced ground rewriting systems from a set of ground equations

Journal of Symbolic Computation
A fast algorithm for constructing a tree automaton recognizing a congruential tree language

Theoretical Computer Science
Proof lengths for equational completion

Information and Computation - special issue: symposium on theoretical aspects of computer software TACS '94
Congruential complements of ground term rewrite systems

Theoretical Computer Science
Restricted ground tree transducers

Theoretical Computer Science
Shostak's Congruence Closure as Completion

RTA '97 Proceedings of the 8th International Conference on Rewriting Techniques and Applications
Complexity of finitely presented algebras

STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
What's in an attribute? consequences for the least common subsumer

Journal of Artificial Intelligence Research

Join algorithms for the theory of uninterpreted functions

FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science

Quantified Score

Hi-index	5.23

Visualization

Abstract

We show that it is decidable for any given ground term rewrite systems R and S if there is a ground term rewrite system U such that ↔U* = ↔R* ∩ ↔S*. If the answer is yes, then we can effectively construct such a ground term rewrite system U. In other words, for any given finitely generated congruences ρ and τ over the term algebra, it is decidable if ρ ∩ τ is a finitely generated congruence. If the answer is yes, then we can effectively construct a ground term rewrite system U such that ↔U* = ρ ∩ τ.