Follow
Manfred Schmidt-Schauß
Manfred Schmidt-Schauß
Professor für Informatik, Goethe-University Frankfurt
Verified email at ki.informatik.uni-frankfurt.de
Title
Cited by
Cited by
Year
Attributive concept descriptions with complements
M Schmidt-Schauß, G Smolka
Artificial intelligence 48 (1), 1-26, 1991
15661991
Subsumption in KL-ONE is undecidable
M Schmidt-Schauß
Artificial Intelligence Laboratories, Fachbereich Informatik, Univ …, 1988
3241988
Computational aspects of an order-sorted logic with term declarations
M Schmidt-Schauß
Springer Berlin Heidelberg, 1989
2831989
Unification in a combination of arbitrary disjoint equational theories
M Schmidt-Schauß
Journal of Symbolic Computation 8 (1-2), 51-99, 1989
1841989
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
881989
Implication of clauses is undecidable
M Schmidt-Schauß
Theoretical Computer Science 59 (3), 287-296, 1988
781988
Safety of Nöcker's strictness analysis
M Schmidt-Schauß, D Sabel, M Schütz
Journal of functional programming 18 (4), 503-551, 2008
672008
Unification in Boolean rings and Abelian groups
A Boudet, JP Jouannaud, M Schmidt-Schauss
Journal of Symbolic Computation 8 (5), 449-477, 1989
621989
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
562008
A decision algorithm for distributive unification
M Schmidt-Schauβ
Theoretical Computer Science 208 (1-2), 111-148, 1998
56*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
541998
Unification under associativity and idempotence is of type nullary
M Schmidt-Schauß
Journal of Automated Reasoning 2 (3), 277-281, 1986
521986
A non-deterministic call-by-need lambda calculus
A Kutzner, M Schmidt-Schauß
ACM SIGPLAN Notices 34 (1), 324-335, 1998
501998
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
461997
A decision algorithm for stratified context unification
M Schmidt‐Schauß
Journal of Logic and Computation 12 (6), 929-953, 2002
452002
Combination of unification algorithms
M Schmidt-Schau
Journal of Symbolic Computation 8 (1), 51-100, 1989
451989
A contextual semantics for Concurrent Haskell with futures
D Sabel, M Schmidt-Schauß
Proceedings of the 13th international ACM SIGPLAN symposium on Principles …, 2011
432011
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
432007
Parameter reduction and automata evaluation for grammar-compressed trees
M Lohrey, S Maneth, M Schmidt-Schauß
Journal of Computer and System Sciences 78 (5), 1651-1669, 2012
412012
Solvability of context equations with two context variables is decidable
M Schmidt-Schauß, KU Schulz
Journal of Symbolic Computation 33 (1), 77-122, 2002
412002
The system can't perform the operation now. Try again later.
Articles 1–20