Socher-Ambrosius, R.: Completeness of resolution and superposition calculi. Max-Planck-Institut für Informatik, Saarbrücken (1992), 9 pp.

Socher-Ambrosius, R.: Semi-unification. Max-Planck-Institut für Informatik, Saarbrücken (1992), 10 pp.

Socher-Ambrosius, R.: A goal oriented strategy based on completion. Max-Planck-Institut für Informatik, Saarbrücken (1992), 14 pp.

Sogomonjan, E. S.; Goessel, M.: Self-testing and self-checking combinational circuits with weakly independent outputs. Max-Planck-Institut für Informatik, Saarbrücken (1992), 18 pp.

Szalas, A.: On correspondence between modal and classical logic: automated approach. Max-Planck-Institut für Informatik, Saarbrücken (1992), 17 pp.

Szalas, A.: On natural deduction in fixpoint logics. Max-Planck-Institut für Informatik, Saarbrücken (1992), 18 pp.

Wertz, U.: First-order theorem proving modulo equations. Max-Planck-Institut für Informatik, Saarbrücken (1992), 108 pp.

Zelikovsky, A.: A faster 11/6-approximation algorithm for the Steiner tree problem in graphs. Max-Planck-Institut für Informatik, Saarbrücken (1992), 8 pp.

Zelikovsky, A.: Minimum base of weighted k polymatroid and Steiner tree problem. Max-Planck-Institut für Informatik, Saarbrücken (1992), 9 pp.