1. J. Avenhaus. Transforming infinite rewrite systems into finite rewrite systems by embedding techniques. SEKI-Report SR-89–21, Universität Kaiserslautern (1989).
2. J. Avenhaus. Proving equational and inductive theorems by completion and embedding techniques. In: Proc. RTA’91, Como (1991), 361–373.
3. H. Comon, C. Delor. Equational formulae with membership constraints. Information and Computation 112 (2) (1994), 167–216.
4. H. Chen, J. Hsiang. Logic Programming in Recurrence domains. In: Proc. ICALP ‘81,Madrid (1991), 20–34.
5. H. Chen, J. Hsiang, H.-C. Kong. On finite representations of infinite sequences of terms. Preprint, Extended abstract in: Proc. CTRS ‘80,Montreal (1990), 37–44.