(2008), in that we perform redundancy elimination by intersecting tree grammars.
the construction we present here is much more general: The algorithmic foundation for redundancy elimination is now exactly the same as that for weakest readings, we only have to use an equivalencepreserving rewrite system instead of a weakening one.