Your search returned the following 9 documents:

9. A Refined Version of General E-Unification
   Rolf Socher-Ambrosius
   In: Proceedings of the 12th International Conference on Automated Deduction (CADE-12), Nancy, France, June 26 - July 1, 1994, 1994, 665-677
   
8. Solving Simplificating Ordering Constraints
   Patricia Johann and Rolf Socher-Ambrosius
   In: Proceedings of the 1st International Conference on Constraints in Computational Logics (CCL'94), Munich, Germany, September 7-9, 1994, 1994, 352-367
   
7. Unification in Order-Sorted Logic with Term Declarations
   Rolf Socher-Ambrosius
   In: Proceedings of the 4th Conference on Logic Programming and Automated Reasoning (LPAR-93), St. Petersburg, Russia, July, 13-20, 1993, 301-308
   
6. A Goal Oriented Strategy Based on Completion
   Rolf Socher-Ambrosius
   In: Proc.~3rd Intern.~Conference on Algebraic and Logic Programming, Volterra, Italy, 1992, 435-445. Note: Also available as Research Report MPI-I-92-206
   
5. How to Avoid the Derivation of Redundant Clauses in Reasoning Systems
   Rolf Socher-Ambrosius
   Journal of Automated Reasoning 9 (1): 325-336, 1992
   
4. Boolean Algebra Admits no Convergent Term Rewriting System
   Rolf Socher-Ambrosius
   In: Proceedings of the 4th International Conference on Rewriting Techniques and Applications (RTA-91), Como, Italy, April, 10-12, 1991, 264-274
   
3. On the Relation Between Completion Based and Resolution Based Theorem Proving
   Rolf Socher-Ambrosius
   Journal of Symbolic Computation 11 (1 & 2): 129-148, 1991
   
2. On the Church-Rosser Property in Left-Linear Systems
   Rolf Socher-Ambrosius
   SUNY at Stony Brook, {TR} 91/17
   
1. Optimizing the Clausal Normal Form Transformation
   Rolf Socher-Ambrosius
   Journal of Automated Reasoning 7 (3): 325-336, 1991