| * | 1994 |
|---|
| 13 | EE | Rolf Socher-Ambrosius:
A Refined Version of General E-Unification.
CADE 1994: 665-677 |
| 12 | | Patricia Johann,
Rolf Socher-Ambrosius:
Solving Simplification Ordering Constraints.
CCL 1994: 352-367 |
| 1993 |
|---|
| 11 | EE | Rolf Socher-Ambrosius:
Unification in Order-Sorted Logic With Term Declarations.
LPAR 1993: 301-308 |
| 1992 |
|---|
| 10 | EE | Rolf Socher-Ambrosius:
A Goal Oriented Strategy Based on Completion.
ALP 1992: 435-445 |
| 9 | | Rolf Socher-Ambrosius:
How to Avoid the Derivation of Redundant Clauses in Reasoning Systems.
J. Autom. Reasoning 9(1): 77-97 (1992) |
| 1991 |
|---|
| 8 | EE | Rolf Socher-Ambrosius:
Boolean Algebra Admits No Convergent Term Rewriting System.
RTA 1991: 264-274 |
| 1990 |
|---|
| 7 | | Rolf Socher-Ambrosius:
Another Technique for Proving Completeness of Ground Resolution.
Bulletin of the EATCS 42: 187-189 (1990) |
| 1989 |
|---|
| 6 | | Jürgen Müller,
Rolf Socher-Ambrosius:
A Resolution Calculus Extende by Equivalence.
GWAI 1989: 102-106 |
| 5 | | Rolf Socher-Ambrosius:
Detecting Redundancy Caused by Congruent Links in Clause Graphs.
GWAI 1989: 74-82 |
| 4 | | Rolf Socher-Ambrosius:
Reducing the Derivation of Redundant Clauses in Reasoning Systems.
IJCAI 1989: 401-406 |
| 3 | | Jürgen Müller,
Rolf Socher-Ambrosius:
Workshop on Automated Reasoning.
KI 3(4): 20-21 (1989) |
| 1988 |
|---|
| 2 | | Jürgen Müller,
Rolf Socher-Ambrosius:
On the Unnecessity of Multiple Overlaps in Completion Theorem Proving.
GWAI 1988: 169-178 |
| 1 | | Rolf Socher-Ambrosius:
Using Theory Resolution to Simplify Interpreted Formulae.
GWAI 1988: 179-185 |
