| Attributive concept descriptions with complements M Schmidt-Schauß, G Smolka Artificial intelligence 48 (1), 1-26, 1991 | 1658 | 1991 |
| Unification theory F Baader, W Snyder Handbook of automated reasoning 1, 445-532, 2001 | 1003 | 2001 |
| Subsumption in KL-ONE is Undecidable. M Schmidt-Schauß KR 89, 421-431, 1989 | 342 | 1989 |
| Computational aspects of an order-sorted logic with term declarations M Schmidt-Schauß Springer Berlin Heidelberg, 1989 | 279 | 1989 |
| Unification in a combination of arbitrary disjoint equational theories M Schmidt-Schauß Journal of Symbolic Computation 8 (1-2), 51-99, 1989 | 184 | 1989 |
| On equational theories, unification, and (un) decidability HJ Bürckert, A Herold, M Schmidt-Schauss Journal of Symbolic Computation 8 (1-2), 3-49, 1989 | 90 | 1989 |
| Implication of clauses is undecidable M Schmidt-Schauß Theoretical Computer Science 59 (3), 287-296, 1988 | 79 | 1988 |
| Unification in Boolean rings and Abelian groups A Boudet, JP Jouannaud, M Schmidt-Schauss Journal of Symbolic Computation 8 (5), 449-477, 1989 | 66 | 1989 |
| Safety of Nöcker's strictness analysis M Schmidt-Schauß, D Sabel, M Schütz Journal of Functional Programming 18 (4), 503-551, 2008 | 65 | 2008 |
| A decision algorithm for distributive unification M Schmidt-Schauβ Theoretical Computer Science 208 (1-2), 111-148, 1998 | 59* | 1998 |
| On the exponent of periodicity of minimal solutions of context equations M Schmidt-Schauß, KU Schulz International Conference on Rewriting Techniques and Applications, 61-75, 1998 | 56 | 1998 |
| Unification under associativity and idempotence is of type nullary M Schmidt-Schauß Journal of Automated Reasoning 2 (3), 277-281, 1986 | 56 | 1986 |
| A call-by-need lambda calculus with locally bottom-avoiding choice: context lemma and correctness of transformations D Sabel, M Schmidt-Schauß Mathematical Structures in Computer Science 18 (3), 501-553, 2008 | 55 | 2008 |
| A non-deterministic call-by-need lambda calculus A Kutzner, M Schmidt-Schauß ACM SIGPLAN Notices 34 (1), 324-335, 1998 | 53 | 1998 |
| A decision algorithm for stratified context unification M Schmidt‐Schauß Journal of Logic and Computation 12 (6), 929-953, 2002 | 47 | 2002 |
| A many-sorted calculus with polymorphic functions based on resolution and paramodulation M Schmidt-Schauß Saarländische Universitäts-und Landesbibliothek, 1985 | 46 | 1985 |
| TEA: Automatically proving termination of programs in a non-strict higher-order functional language SE Panitz, M Schmidt-Schauß Static Analysis: 4th International Symposium, SAS'97 Paris, France …, 1997 | 45 | 1997 |
| Unification in many-sorted equational theories M Schmidt-Schauß 8th International Conference on Automated Deduction: Oxford, England, July …, 1986 | 45 | 1986 |
| Combination of unification algorithms M Schmidt-Schauß Journal of Symbolic Computation 8 (1), 51-100, 1989 | 44 | 1989 |
| Observational semantics for a concurrent lambda calculus with reference cells and futures J Niehren, D Sabel, M Schmidt-Schauß, J Schwinghammer Electronic Notes in Theoretical Computer Science 173, 313-337, 2007 | 42 | 2007 |
