TRSPEC: A Term Rewriting Based System for Algebraic Specifications. - Jürgen Avenhaus; Richard Göbel; Bernhard Gramlich; Klaus Madlener; Joachim Steinbach (CTRS, 1987)

UNICOM: A Refined Completion Based Inductive Theorem Prover. - Bernhard Gramlich (CADE, 1990)

Completion Based Inductive Theorem Proving: An Abstract Framework and its Applications. - Bernhard Gramlich (ECAI, 1990)

Sufficient Conditions for Modular Termination of Conditional Term Rewriting Systems. - Bernhard Gramlich (CTRS, 1992)

A Constructor-Based Approach for Positive/Negative-Conditional Equational Specifications. - Claus-Peter Wirth; Bernhard Gramlich (CTRS, 1992)

Relating Innermost, Weak, Uniform and Modular Termination of Term Rewriting Systems. - Bernhard Gramlich (LPAR, 1992)

On Modularity of Termination and Confluence Properties of Conditional Rewrite Systems. - Bernhard Gramlich (ALP, 1994)

On Notions of Inductive Validity for First-Oder Equational Clauses. - Claus-Peter Wirth; Bernhard Gramlich (CADE, 1994)

On Termination and Confluence of Conditional Rewrite Systems. - Bernhard Gramlich (CTRS, 1994)

Generalized Sufficient Conditions for Modular Termination of Rewriting. - Bernhard Gramlich (Appl. Algebra Eng. Commun. Comput., 1994)

A Note on a Parameterized Version of the Well-Founded Induction Pricible. - Bernhard Gramlich (Bull. EATCS, 1994)

A Constructor-Based Approach to Positive/Negative-Conditional Equational Specifications. - Claus-Peter Wirth; Bernhard Gramlich (J. Symb. Comput., 1994)

Simple termination is difficult. - Aart Middeldorp; Bernhard Gramlich (Appl. Algebra Eng. Commun. Comput., 1995)

Abstract Relations between Restricted Termination and Confluence Properties of Rewrite Systems. - Bernhard Gramlich (Fundam. Informaticae, 1995)

Confluence without Termination via Parallel Critical Pairs. - Bernhard Gramlich (CAAP, 1996)

On Proving Termination by Innermost Termination. - Bernhard Gramlich (RTA, 1996)

Confluence of Terminating Conditional Rewrite Systems Revisited. - Bernhard Gramlich; Claus-Peter Wirth (RTA, 1996)

On Termination and Confluence Properties of Disjoint and Constructor-Sharing Conditional Rewrite Systems. - Bernhard Gramlich (Theor. Comput. Sci., 1996)

Termination and confluence: properties of structured rewrite systems. - Bernhard Gramlich (1996)

Modular aspects of rewrite-based specifications. - Bernhard Gramlich (WADT, 1997)

Simplifying termination proofs for rewrite systems by preprocessing. - Bernhard Gramlich (PPDP, 2000)

Editorial: Strategies in Automated Deduction. - Bernhard Gramlich; Hélène Kirchner; Frank Pfenning (Ann. Math. Artif. Intell., 2000)

Preface: STRATEGIES 2001. - Maria Paola Bonacina; Bernhard Gramlich (STRATEGIES@IJCAR, 2001)

On interreduction of semi-complete term rewriting systems. - Bernhard Gramlich (Theor. Comput. Sci., 2001)

1st International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2001) - Preface. - Bernhard Gramlich; Salvador Lucas (WRS, 2001)

Algorithmic Aspects of Herbrand Models Represented by Ground Atoms with Ground Equations. - Bernhard Gramlich; Reinhard Pichler (CADE, 2002)

Improving On-Demand Strategy Annotations. - María Alpuente; Santiago Escobar 001; Bernhard Gramlich; Salvador Lucas (LPAR, 2002)

Modular termination of context-sensitive rewriting. - Bernhard Gramlich; Salvador Lucas (PPDP, 2002)

Simple termination of context-sensitive rewriting. - Bernhard Gramlich; Salvador Lucas (ACM SIGPLAN Workshop on Rule-Based Programming, 2002)

Preface. - Bernhard Gramlich; Salvador Lucas (WRS, 2002)

Preface: 3rd International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2003) - Final Proceedings. - Bernhard Gramlich; Salvador Lucas (WRS, 2003)

Strategic Issues, Problems and Challenges in Inductive Theorem Proving. - Bernhard Gramlich (STRATEGIES@IJCAR, 2004)

Reduction strategies in rewriting and programming. - Bernhard Gramlich; Salvador Lucas (J. Symb. Comput., 2005)

Generalizing Newman's Lemma for Left-Linear Rewrite Systems. - Bernhard Gramlich; Salvador Lucas (RTA, 2006)

A Framework for Timed Concurrent Constraint Programming with External Functions. - María Alpuente; Bernhard Gramlich; Alicia Villanueva (PROLE, 2006)

Termination of Lazy Rewriting Revisited. - Felix Schernhammer; Bernhard Gramlich (WRS@RDP, 2007)

Transformations of Conditional Rewrite Systems Revisited. - Karl Gmeiner; Bernhard Gramlich (WADT, 2008)

VMTL-A Modular Termination Laboratory. - Felix Schernhammer; Bernhard Gramlich (RTA, 2009)

Extending Context-Sensitivity in Term Rewriting - Bernhard Gramlich; Felix Schernhammer (WRS, 2009)

On (Un)Soundness of Unravelings. - Karl Gmeiner; Bernhard Gramlich; Felix Schernhammer (RTA, 2010)

Termination of Rewriting with and Automated Synthesis of Forbidden Patterns - Bernhard Gramlich; Felix Schernhammer (IWS, 2010)

Characterizing and proving operational termination of deterministic conditional term rewriting systems. - Felix Schernhammer; Bernhard Gramlich (J. Log. Algebraic Methods Program., 2010)

On-demand strategy annotations revisited: An improved on-demand evaluation strategy. - María Alpuente; Santiago Escobar 001; Bernhard Gramlich; Salvador Lucas (Theor. Comput. Sci., 2010)

On Soundness Conditions for Unraveling Deterministic Conditional Rewrite Systems. - Karl Gmeiner; Bernhard Gramlich; Felix Schernhammer (RTA, 2012)

Realizing Monads in Interaction Nets via Generic Typed Rules. - Eugen Jiresch; Bernhard Gramlich (TAMC, 2012)

Modularity in term rewriting revisited. - Bernhard Gramlich (Theor. Comput. Sci., 2012)