The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Manfred Schmidt-Schauß: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Manfred Schmidt-Schauß, Gert Smolka
    Attributive Concept Descriptions with Complements. [Citation Graph (7, 0)][DBLP]
    Artif. Intell., 1991, v:48, n:1, pp:1-26 [Journal]
  2. Bernhard Hollunder, Werner Nutt, Manfred Schmidt-Schauß
    Subsumption Algorithms for Concept Description Languages. [Citation Graph (5, 0)][DBLP]
    ECAI, 1990, pp:348-353 [Conf]
  3. Manfred Schmidt-Schauß
    Subsumption in KL-ONE is Undecidable. [Citation Graph (2, 0)][DBLP]
    KR, 1989, pp:421-431 [Conf]
  4. Nigel W. O. Hutchison, Ute Neuhaus, Manfred Schmidt-Schauß, Cordelia V. Hall
    Natural Expert: A Commercial Functional Programming Environment. [Citation Graph (1, 0)][DBLP]
    J. Funct. Program., 1997, v:7, n:2, pp:163-182 [Journal]
  5. Manfred Schmidt-Schauß
    Decidable Variants of Higher-Order Unification. [Citation Graph (0, 0)][DBLP]
    Mechanizing Mathematical Reasoning, 2005, pp:154-168 [Conf]
  6. Jordi Levy, Manfred Schmidt-Schauß, Mateu Villaret
    Stratified Context Unification Is NP-Complete. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2006, pp:82-96 [Conf]
  7. Manfred Schmidt-Schauß
    Decidability of Arity-Bounded Higher-Order Matching. [Citation Graph (0, 0)][DBLP]
    CADE, 2003, pp:488-502 [Conf]
  8. Manfred Schmidt-Schauß
    Unification in Many-Sorted Eqational Theories. [Citation Graph (0, 0)][DBLP]
    CADE, 1986, pp:538-552 [Conf]
  9. Manfred Schmidt-Schauß
    Unification in a Combination of Arbitrary Disjoint Equational Theories. [Citation Graph (0, 0)][DBLP]
    CADE, 1988, pp:378-396 [Conf]
  10. Manfred Schmidt-Schauß, Klaus U. Schulz
    Solvability of Context Equations with Two Context Variables is Decidable. [Citation Graph (0, 0)][DBLP]
    CADE, 1999, pp:67-81 [Conf]
  11. Manfred Schmidt-Schauß
    Stratified Context Unification Is in PSPACE. [Citation Graph (0, 0)][DBLP]
    CSL, 2001, pp:498-512 [Conf]
  12. Manfred Schmidt-Schauß, Klaus U. Schulz
    Decidability of Bounded Higher-Order Unification. [Citation Graph (0, 0)][DBLP]
    CSL, 2002, pp:522-536 [Conf]
  13. Manfred Schmidt-Schauß
    External Function Calls in a Functional Language. [Citation Graph (0, 0)][DBLP]
    Functional Programming, 1991, pp:324-331 [Conf]
  14. Pok-Son Kim, Manfred Schmidt-Schauß
    A Term-Based Approach to Project Scheduling. [Citation Graph (0, 0)][DBLP]
    ICCS, 2001, pp:304-318 [Conf]
  15. Arne Kutzner, Manfred Schmidt-Schauß
    A Non-Deterministic Call-by-Need Lambda Calculus. [Citation Graph (0, 0)][DBLP]
    ICFP, 1998, pp:324-335 [Conf]
  16. Manfred Schmidt-Schauß
    A Many-Sorted Calculus with Polymorphic Functions Based on Resolution and Paramodulation. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1985, pp:1162-1168 [Conf]
  17. Manfred Schmidt-Schauß
    Unification in a Many-sorted Calculus with Declarations. [Citation Graph (0, 0)][DBLP]
    GWAI, 1985, pp:118-132 [Conf]
  18. Alexandre Boudet, Jean-Pierre Jouannaud, Manfred Schmidt-Schauß
    Unification in Free Extensions of Boolean Rings and Abelian Groups [Citation Graph (0, 0)][DBLP]
    LICS, 1988, pp:121-130 [Conf]
  19. Manfred Schmidt-Schauß
    Unification Under One-Sided Distributivity with a Multiplicative Unit. [Citation Graph (0, 0)][DBLP]
    LPAR, 1993, pp:289-300 [Conf]
  20. Hans-Jürgen Bürckert, Alexander Herold, Manfred Schmidt-Schauß
    On Equational Theories, Unification and Decidability. [Citation Graph (0, 0)][DBLP]
    RTA, 1987, pp:204-215 [Conf]
  21. Jordi Levy, Manfred Schmidt-Schauß, Mateu Villaret
    Monadic Second-Order Unification Is NP-Complete. [Citation Graph (0, 0)][DBLP]
    RTA, 2004, pp:55-69 [Conf]
  22. Jordi Levy, Manfred Schmidt-Schauß, Mateu Villaret
    Bounded Second-Order Unification Is NP-Complete. [Citation Graph (0, 0)][DBLP]
    RTA, 2006, pp:400-414 [Conf]
  23. Manfred Schmidt-Schauß
    An Algorithm for Distributive Unification. [Citation Graph (0, 0)][DBLP]
    RTA, 1996, pp:287-301 [Conf]
  24. Manfred Schmidt-Schauß, Klaus U. Schulz
    On the Exponent of Periodicity of Minimal Solutions of Context Equation. [Citation Graph (0, 0)][DBLP]
    RTA, 1998, pp:61-75 [Conf]
  25. Sven Eric Panitz, Manfred Schmidt-Schauß
    TEA: Automatically Proving Termination of Programs in a Non-strict Higher-Order Functional Language. [Citation Graph (0, 0)][DBLP]
    SAS, 1997, pp:345-360 [Conf]
  26. Manfred Schmidt-Schauß, Sven Eric Panitz, Marko Schütz
    Abstract Reduction Using a Tableau Calculus [Citation Graph (0, 0)][DBLP]
    SAS, 1995, pp:348-365 [Conf]
  27. Manfred Schmidt-Schauß, Michael Huber
    A Lambda-Calculus with letrec, case, constructors and non-determinism [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  28. Joachim Niehren, David Sabel, Manfred Schmidt-Schauß, Jan Schwinghammer
    Observational Semantics for a Concurrent Lambda Calculus with Reference Cells and Futures. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2007, v:173, n:, pp:313-337 [Journal]
  29. Manfred Schmidt-Schauß
    Decidability of bounded second order unification. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2004, v:188, n:2, pp:143-178 [Journal]
  30. Hans Jürgen Ohlbach, Manfred Schmidt-Schauß
    The Lion and the Unicorn. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 1985, v:1, n:3, pp:327-332 [Journal]
  31. Manfred Schmidt-Schauß
    Unification under Associativity and Idempotence is of Type Nullary. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 1986, v:2, n:3, pp:277-281 [Journal]
  32. Alexandre Boudet, Jean-Pierre Jouannaud, Manfred Schmidt-Schauß
    Unification in Boolean Rings and Abelian Groups. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1989, v:8, n:5, pp:449-477 [Journal]
  33. Hans-Jürgen Bürckert, Alexander Herold, Manfred Schmidt-Schauß
    On Equational Theories, Unification, and (Un)Decidability. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1989, v:8, n:1/2, pp:3-49 [Journal]
  34. Manfred Schmidt-Schauß
    Unification in a Combination of Arbitrary Disjoint Equational Theories. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1989, v:8, n:1/2, pp:51-99 [Journal]
  35. Manfred Schmidt-Schauß
    Unification in Permutative Equational Theories is Undecidable. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1989, v:8, n:4, pp:415-421 [Journal]
  36. Manfred Schmidt-Schauß, Klaus U. Schulz
    Solvability of Context Equations with Two Context Variables is Decidable. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 2002, v:33, n:1, pp:77-122 [Journal]
  37. Manfred Schmidt-Schauß, Klaus U. Schulz
    Decidability of bounded higher-order unification. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 2005, v:40, n:2, pp:905-954 [Journal]
  38. Hans Jürgen Ohlbach, Manfred Schmidt-Schauß
    Bericht zur 9th Conference on Automated Deduction. [Citation Graph (0, 0)][DBLP]
    KI, 1988, v:2, n:4, pp:18-19 [Journal]
  39. Manfred Schmidt-Schauß
    A Decision Algorithm for Stratified Context Unification. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 2002, v:12, n:6, pp:929-953 [Journal]
  40. Manfred Schmidt-Schauß, Jürgen Stuber
    The Complexity of Linear and Stratified Context Matching Problems. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2004, v:37, n:6, pp:717-740 [Journal]
  41. Manfred Schmidt-Schauß
    Implication of Clauses is Undecidable. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1988, v:59, n:, pp:287-296 [Journal]
  42. Manfred Schmidt-Schauß
    A Decision Algorithm for Distributive Unification. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:208, n:1-2, pp:111-148 [Journal]
  43. Manfred Schmidt-Schauß
    Decidability of Behavioural Equivalence in Unary PCF. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:216, n:1-2, pp:363-373 [Journal]
  44. Manfred Schmidt-Schauß, Massimo Marchiori, Sven Eric Panitz
    Modular Termination of r-Consistent and Left-Linear Term Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:149, n:2, pp:361-374 [Journal]
  45. Manfred Schmidt-Schauß
    Correctness of Copy in Calculi with Letrec. [Citation Graph (0, 0)][DBLP]
    RTA, 2007, pp:329-343 [Conf]

  46. Parameter Reduction in Grammar-Compressed Trees. [Citation Graph (, )][DBLP]


  47. Reasoning about Contextual Equivalence: From Untyped to Polymorphically Typed Calculi. [Citation Graph (, )][DBLP]


  48. Adequacy of Compositional Translations for Observational Semantics. [Citation Graph (, )][DBLP]


  49. Context Matching for Compressed Terms. [Citation Graph (, )][DBLP]


  50. A Finite Simulation Method in a Non-deterministic Call-by-Need Lambda-Calculus with Letrec, Constructors, and Case. [Citation Graph (, )][DBLP]


  51. Unification with Singleton Tree Grammars. [Citation Graph (, )][DBLP]


  52. Simulation in the Call-by-Need Lambda-Calculus with letrec. [Citation Graph (, )][DBLP]


  53. Unification and Matching on Compressed Terms [Citation Graph (, )][DBLP]


Search in 0.022secs, Finished in 0.026secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002