1. Lecture Notes in Computer Science;B. Beckert,1993
2. Lecture Notes in Computer Science;R. Bonichon,2004
3. Bonichon, R., Hermant, O.: On constructive cut admissibility in deduction modulo (submitted), http://www-spi.lip6.fr/~bonichon/papers/occad-fl.ps
4. Cantone, D., Nicolosi Asmundo, M.: A sound framework for delta-rule variants in free variable semantic tableaux. In: FTP (2005)
5. Degtyarev, A., Voronkov, A.: The undecidability of simultaneous rigid e-unification. Theoretical Computer Science 166(1-2), 291–300 (1996)