Manfred Schmidt-Schauß
Manfred Schmidt-Schauß
Professor für Informatik, Goethe-University Frankfurt
Email verificata su ki.informatik.uni-frankfurt.de
Titolo
Citata da
Citata da
Anno
Attributive concept descriptions with complements
M Schmidt-Schauß, G Smolka
Artificial intelligence 48 (1), 1-26, 1991
15131991
Subsumption in KL-ONE is Undecidable.
M Schmidt-Schauß
KR 89, 421-431, 1989
3171989
Subsumption algorithms for concept languages
B Hollunder, W Nutt, M Schmidt-Schauss
Deutsches Forschungszentrum für Künstliche Intelligenz, 1990
3091990
Computational aspects of an order-sorted logic with term declarations
M Schmidt-Schauß
2791989
Unification in a combination of arbitrary disjoint equational theories
M Schmidt-Schauß
Journal of Symbolic Computation 8 (1-2), 51-99, 1989
1541989
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
841989
Implication of clauses is undecidable
M Schmidt-Schauß
Theoretical Computer Science 59 (3), 287-296, 1988
711988
A fast branching algorithm for cluster vertex deletion
A Boral, M Cygan, T Kociumaka, M Pilipczuk
Theory of Computing Systems 58 (2), 357-376, 2016
68*2016
Safety of Nocker's strictness analysis
M Schmidt-Schauß, D Sabel, M SchUTz
Journal of functional programming 18 (4), 503-552, 2008
622008
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 decision algorithm for distributive unification
M Schmidt-Schauβ
Theoretical Computer Science 208 (1-2), 111-148, 1998
55*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
541986
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-554, 2008
502008
A non-deterministic call-by-need lambda calculus
A Kutzner, M Schmidt-Schauß
ACM SIGPLAN Notices 34 (1), 324-335, 1998
471998
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
Combination of unification algorithms
M Schmidt-Schau
Journal of Symbolic Computation 8 (1), 51-100, 1989
451989
A decision algorithm for stratified context unification
M Schmidt‐Schauß
Journal of Logic and Computation 12 (6), 929-953, 2002
442002
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
422007
Solvability of context equations with two context variables is decidable
M Schmidt-Schauß, KU Schulz
Journal of Symbolic Computation 33 (1), 77-122, 2002
402002
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–20