We propose a cooperating Knuth-Bendix completion procedure for transitive relations and equivalences and apply it as a data structure for novel dynamic strongly connected component algorithms. Benefits are separation of declarative and procedural concerns, simple generic specifications and flexible optimisation via execution strategies.
['Georg Struth']
Knuth-bendix completion as a data structure