Bernhard Gramlich

Bernhard Gramlich: Modularity in term rewriting revisited. Theor. Comput. Sci. 464: 3-19 (2012)

Karl Gmeiner, Bernhard Gramlich, Felix Schernhammer: On Soundness Conditions for Unraveling Deterministic Conditional Rewrite Systems. RTA 2012: 193-208

Eugen Jiresch, Bernhard Gramlich: Realizing Monads in Interaction Nets via Generic Typed Rules. TAMC 2012: 509-524

Bernhard Gramlich, Dale Miller, Uli Sattler (Eds.): Automated Reasoning - 6th International Joint Conference, IJCAR 2012, Manchester, UK, June 26-29, 2012. Proceedings. Lecture Notes in Computer Science 7364, Springer 2012, isbn 978-3-642-31364-6

Felix Schernhammer, Bernhard Gramlich: Characterizing and proving operational termination of deterministic conditional term rewriting systems. J. Log. Algebr. Program. 79(7): 659-688 (2010)

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

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

Bernhard Gramlich, Felix Schernhammer: Termination of Rewriting with and Automated Synthesis of Forbidden Patterns. IWS 2010: 35-50

Felix Schernhammer, Bernhard Gramlich: VMTL-A Modular Termination Laboratory. RTA 2009: 285-294

Bernhard Gramlich, Felix Schernhammer: Extending Context-Sensitivity in Term Rewriting. WRS 2009: 56-68

Felix Schernhammer, Bernhard Gramlich: Termination of Lazy Rewriting Revisited. Electr. Notes Theor. Comput. Sci. 204: 35-51 (2008)

Karl Gmeiner, Bernhard Gramlich: Transformations of Conditional Rewrite Systems Revisited. WADT 2008: 166-186

María Alpuente, Bernhard Gramlich, Alicia Villanueva: A Framework for Timed Concurrent Constraint Programming with External Functions. Electr. Notes Theor. Comput. Sci. 188: 143-155 (2007)

Bernhard Gramlich, Salvador Lucas: Generalizing Newman's Lemma for Left-Linear Rewrite Systems. RTA 2006: 66-80

Bernhard Gramlich: Strategic Issues, Problems and Challenges in Inductive Theorem Proving. Electr. Notes Theor. Comput. Sci. 125(2): 5-43 (2005)

Bernhard Gramlich, Salvador Lucas: Reduction strategies in rewriting and programming. J. Symb. Comput. 40(1): 745-747 (2005)

Bernhard Gramlich (Ed.): Frontiers of Combining Systems, 5th International Workshop, FroCoS 2005, Vienna, Austria, September 19-21, 2005, Proceedings. Lecture Notes in Computer Science 3717, Springer 2005, isbn 3-540-29051-6

Bernhard Gramlich, Salvador Lucas: Preface: 3rd International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2003) - Final Proceedings. Electr. Notes Theor. Comput. Sci. 86(4): 567-569 (2003)

Bernhard Gramlich, Salvador Lucas: Preface. Electr. Notes Theor. Comput. Sci. 70(6): 196-197 (2002)

Bernhard Gramlich, Reinhard Pichler: Algorithmic Aspects of Herbrand Models Represented by Ground Atoms with Ground Equations. CADE 2002: 241-259

María Alpuente, Santiago Escobar, Bernhard Gramlich, Salvador Lucas: Improving On-Demand Strategy Annotations. LPAR 2002: 1-18

Bernhard Gramlich, Salvador Lucas: Modular termination of context-sensitive rewriting. PPDP 2002: 50-61

Bernhard Gramlich, Salvador Lucas: Simple termination of context-sensitive rewriting. ACM SIGPLAN Workshop on Rule-Based Programming 2002: 29-42

Bernhard Gramlich, Salvador Lucas: 1st International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2001) - Preface. Electr. Notes Theor. Comput. Sci. 57: 201-202 (2001)

Maria Paola Bonacina, Bernhard Gramlich: Preface: STRATEGIES 2001. Electr. Notes Theor. Comput. Sci. 58(2): 217-218 (2001)

Bernhard Gramlich: On interreduction of semi-complete term rewriting systems. Theor. Comput. Sci. 258(1-2): 435-451 (2001)

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

Bernhard Gramlich: Simplifying termination proofs for rewrite systems by preprocessing. PPDP 2000: 139-150

Bernhard Gramlich: Modular aspects of rewrite-based specifications. WADT 1997: 253-268

Bernhard Gramlich: On Termination and Confluence Properties of Disjoint and Constructor-Sharing Conditional Rewrite Systems. Theor. Comput. Sci. 165(1): 97-131 (1996)

Bernhard Gramlich: Confluence without Termination via Parallel Critical Pairs. CAAP 1996: 211-225

Bernhard Gramlich: On Proving Termination by Innermost Termination. RTA 1996: 93-107

Bernhard Gramlich, Claus-Peter Wirth: Confluence of Terminating Conditional Rewrite Systems Revisited. RTA 1996: 245-259

Aart Middeldorp, Bernhard Gramlich: Simple termination is difficult. Appl. Algebra Eng. Commun. Comput. 6: 115-128 (1995)

Bernhard Gramlich: Abstract Relations between Restricted Termination and Confluence Properties of Rewrite Systems. Fundam. Inform. 24(1/2): 2-23 (1995)

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

Bernhard Gramlich: A Note on a Parameterized Version of the Well-Founded Induction Pricible. Bulletin of the EATCS 52: 274-277 (1994)

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

Bernhard Gramlich: On Modularity of Termination and Confluence Properties of Conditional Rewrite Systems. ALP 1994: 186-203

Claus-Peter Wirth, Bernhard Gramlich: On Notions of Inductive Validity for First-Oder Equational Clauses. CADE 1994: 162-176

Bernhard Gramlich: On Termination and Confluence of Conditional Rewrite Systems. CTRS 1994: 166-185

Aart Middeldorp, Bernhard Gramlich: Simple Termination is Difficult. RTA 1993: 228-242

Bernhard Gramlich: Generalized Sufficient Conditions for Modular Termination of Rewriting. ALP 1992: 53-68

Bernhard Gramlich: Sufficient Conditions for Modular Termination of Conditional Term Rewriting Systems. CTRS 1992: 128-142

Claus-Peter Wirth, Bernhard Gramlich: A Constructor-Based Approach for Positive/Negative-Conditional Equational Specifications. CTRS 1992: 198-212

Bernhard Gramlich: Relating Innermost, Weak, Uniform and Modular Termination of Term Rewriting Systems. LPAR 1992: 285-296

Bernhard Gramlich: UNICOM: A Refined Completion Based Inductive Theorem Prover. CADE 1990: 655-656

Bernhard Gramlich: Completion Based Inductive Theorem Proving: An Abstract Framework and its Applications. ECAI 1990: 314-319

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