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

Search the dblp DataBase

Title:
Author:
Bernhard Gramlich: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Bernhard Gramlich
    Generalized Sufficient Conditions for Modular Termination of Rewriting. [Citation Graph (0, 0)][DBLP]
    ALP, 1992, pp:53-68 [Conf]
  2. Bernhard Gramlich
    On Modularity of Termination and Confluence Properties of Conditional Rewrite Systems. [Citation Graph (0, 0)][DBLP]
    ALP, 1994, pp:186-203 [Conf]
  3. Bernhard Gramlich
    Confluence without Termination via Parallel Critical Pairs. [Citation Graph (0, 0)][DBLP]
    CAAP, 1996, pp:211-225 [Conf]
  4. Bernhard Gramlich
    UNICOM: A Refined Completion Based Inductive Theorem Prover. [Citation Graph (0, 0)][DBLP]
    CADE, 1990, pp:655-656 [Conf]
  5. Bernhard Gramlich, Reinhard Pichler
    Algorithmic Aspects of Herbrand Models Represented by Ground Atoms with Ground Equations. [Citation Graph (0, 0)][DBLP]
    CADE, 2002, pp:241-259 [Conf]
  6. Claus-Peter Wirth, Bernhard Gramlich
    On Notions of Inductive Validity for First-Oder Equational Clauses. [Citation Graph (0, 0)][DBLP]
    CADE, 1994, pp:162-176 [Conf]
  7. Bernhard Gramlich
    On Termination and Confluence of Conditional Rewrite Systems. [Citation Graph (0, 0)][DBLP]
    CTRS, 1994, pp:166-185 [Conf]
  8. Jürgen Avenhaus, Richard Göbel, Bernhard Gramlich, Klaus Madlener, Joachim Steinbach
    TRSPEC: A Term Rewriting Based System for Algebraic Specifications. [Citation Graph (0, 0)][DBLP]
    CTRS, 1987, pp:245-248 [Conf]
  9. Claus-Peter Wirth, Bernhard Gramlich
    A Constructor-Based Approach for Positive/Negative-Conditional Equational Specifications. [Citation Graph (0, 0)][DBLP]
    CTRS, 1992, pp:198-212 [Conf]
  10. Bernhard Gramlich
    Sufficient Conditions for Modular Termination of Conditional Term Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    CTRS, 1992, pp:128-142 [Conf]
  11. Bernhard Gramlich
    Completion Based Inductive Theorem Proving: An Abstract Framework and its Applications. [Citation Graph (0, 0)][DBLP]
    ECAI, 1990, pp:314-319 [Conf]
  12. María Alpuente, Santiago Escobar, Bernhard Gramlich, Salvador Lucas
    Improving On-Demand Strategy Annotations. [Citation Graph (0, 0)][DBLP]
    LPAR, 2002, pp:1-18 [Conf]
  13. Bernhard Gramlich
    Relating Innermost, Weak, Uniform and Modular Termination of Term Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    LPAR, 1992, pp:285-296 [Conf]
  14. Bernhard Gramlich
    Simplifying termination proofs for rewrite systems by preprocessing. [Citation Graph (0, 0)][DBLP]
    PPDP, 2000, pp:139-150 [Conf]
  15. Bernhard Gramlich, Salvador Lucas
    Modular termination of context-sensitive rewriting. [Citation Graph (0, 0)][DBLP]
    PPDP, 2002, pp:50-61 [Conf]
  16. Bernhard Gramlich
    On Proving Termination by Innermost Termination. [Citation Graph (0, 0)][DBLP]
    RTA, 1996, pp:93-107 [Conf]
  17. Bernhard Gramlich, Salvador Lucas
    Generalizing Newman's Lemma for Left-Linear Rewrite Systems. [Citation Graph (0, 0)][DBLP]
    RTA, 2006, pp:66-80 [Conf]
  18. Bernhard Gramlich, Claus-Peter Wirth
    Confluence of Terminating Conditional Rewrite Systems Revisited. [Citation Graph (0, 0)][DBLP]
    RTA, 1996, pp:245-259 [Conf]
  19. Aart Middeldorp, Bernhard Gramlich
    Simple Termination is Difficult. [Citation Graph (0, 0)][DBLP]
    RTA, 1993, pp:228-242 [Conf]
  20. Bernhard Gramlich, Salvador Lucas
    Simple termination of context-sensitive rewriting. [Citation Graph (0, 0)][DBLP]
    ACM SIGPLAN Workshop on Rule-Based Programming, 2002, pp:29-42 [Conf]
  21. Bernhard Gramlich
    Modular aspects of rewrite-based specifications. [Citation Graph (0, 0)][DBLP]
    WADT, 1997, pp:253-268 [Conf]
  22. Bernhard Gramlich
    Generalized Sufficient Conditions for Modular Termination of Rewriting. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 1994, v:5, n:, pp:131-158 [Journal]
  23. Aart Middeldorp, Bernhard Gramlich
    Simple Termination Difficult. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 1995, v:6, n:, pp:115-128 [Journal]
  24. Bernhard Gramlich, Hélène Kirchner, Frank Pfenning
    Editorial: Strategies in Automated Deduction. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 2000, v:29, n:1-4, pp:- [Journal]
  25. Bernhard Gramlich
    A Note on a Parameterized Version of the Well-Founded Induction Pricible. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1994, v:52, n:, pp:274-277 [Journal]
  26. Bernhard Gramlich
    Strategic Issues, Problems and Challenges in Inductive Theorem Proving. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2005, v:125, n:2, pp:5-43 [Journal]
  27. Bernhard Gramlich, Salvador Lucas
    Preface. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2002, v:70, n:6, pp:- [Journal]
  28. Bernhard Gramlich, Salvador Lucas
    3rd International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2003) - Final Proceedings. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2003, v:86, n:4, pp:- [Journal]
  29. Bernhard Gramlich
    Abstract Relations between Restricted Termination and Confluence Properties of Rewrite Systems. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1995, v:24, n:1/2, pp:2-23 [Journal]
  30. Bernhard Gramlich, Salvador Lucas
    Reduction strategies in rewriting and programming. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 2005, v:40, n:1, pp:745-747 [Journal]
  31. Claus-Peter Wirth, Bernhard Gramlich
    A Constructor-Based Approach to Positive/Negative-Conditional Equational Specifications. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1994, v:17, n:1, pp:51-90 [Journal]
  32. Maria Paola Bonacina, Bernhard Gramlich
    Preface: STRATEGIES 2001. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2001, v:58, n:2, pp:- [Journal]
  33. Bernhard Gramlich
    On interreduction of semi-complete term rewriting systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:258, n:1-2, pp:435-451 [Journal]
  34. Bernhard Gramlich
    On Termination and Confluence Properties of Disjoint and Constructor-Sharing Conditional Rewrite Systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:165, n:1, pp:97-131 [Journal]
  35. Bernhard Gramlich, Salvador Lucas
    1st International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2001) - Preface. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2001, v:57, n:, pp:- [Journal]
  36. María Alpuente, Bernhard Gramlich, Alicia Villanueva
    A Framework for Timed Concurrent Constraint Programming with External Functions. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2007, v:188, n:, pp:143-155 [Journal]

  37. VMTL-A Modular Termination Laboratory. [Citation Graph (, )][DBLP]


  38. On (Un)Soundness of Unravelings. [Citation Graph (, )][DBLP]


  39. Transformations of Conditional Rewrite Systems Revisited. [Citation Graph (, )][DBLP]


  40. Extending Context-Sensitivity in Term Rewriting [Citation Graph (, )][DBLP]


  41. Termination of Lazy Rewriting Revisited. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.304secs
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