| Attributive concept descriptions with complements M Schmidt-Schauß, G Smolka Artificial intelligence 48 (1), 1-26, 1991 | 1703 | 1991 |
| Unification theory F Baader, W Snyder Handbook of automated reasoning 1, 445-532, 2001 | 1080 | 2001 |
| Subsumption in KL-ONE is undecidable M Schmidt-Schauß Saarländische Universitäts-und Landesbibliothek, 1988 | 352 | 1988 |
| Computational aspects of an order-sorted logic with term declarations M Schmidt-Schauß Springer Berlin Heidelberg, 1989 | 277 | 1989 |
| Unification in a combination of arbitrary disjoint equational theories M Schmidt-Schauß Journal of Symbolic Computation 8 (1-2), 51-99, 1989 | 186 | 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 | 96 | 1989 |
| Implication of clauses is undecidable M Schmidt-Schauß Theoretical Computer Science 59 (3), 287-296, 1988 | 80 | 1988 |
| Unification in Boolean rings and Abelian groups A Boudet, JP Jouannaud, M Schmidt-Schauss Journal of Symbolic Computation 8 (5), 449-477, 1989 | 72 | 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 | 67 | 2008 |
| Unification under associativity and idempotence is of type nullary M Schmidt-Schauß Journal of Automated Reasoning 2 (3), 277-281, 1986 | 64 | 1986 |
| A decision algorithm for distributive unification M Schmidt-Schauβ Theoretical Computer Science 208 (1-2), 111-148, 1998 | 60* | 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 | 58 | 1998 |
| 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 | 57 | 2008 |
| A non-deterministic call-by-need lambda calculus A Kutzner, M Schmidt-Schauß ACM SIGPLAN Notices 34 (1), 324-335, 1998 | 55 | 1998 |
| A decision algorithm for stratified context unification M Schmidt‐Schauß Journal of Logic and Computation 12 (6), 929-953, 2002 | 50 | 2002 |
| Combination of unification algorithms M Schmidt-Schauß Journal of Symbolic Computation 8 (1), 51-100, 1989 | 48 | 1989 |
| A many-sorted calculus with polymorphic functions based on resolution and paramodulation M Schmidt-Schauß Saarländische Universitäts-und Landesbibliothek, 1985 | 45 | 1985 |
| Solvability of context equations with two context variables is decidable M Schmidt-Schauß, KU Schulz Journal of Symbolic Computation 33 (1), 77-122, 2002 | 44 | 2002 |
| TEA: Automatically proving termination of programs in a non-strict higher-order functional language SE Panitz, M Schmidt-Schauß International Static Analysis Symposium, 345-360, 1997 | 44 | 1997 |
| A contextual semantics for Concurrent Haskell with futures D Sabel, M Schmidt-Schauß Proceedings of the 13th international ACM SIGPLAN symposium on Principles …, 2011 | 43 | 2011 |
