B. Gramlich

发表

B. Gramlich, 1993 .

Internal Strategies in a Reeective Logic Strategies and Rewriting in Elan Tacticals in Ilf -and Why They Are Superruous Bernd Ingo Dahn 1.40pm -2.10pm Break Session 2: Strategy Analysis 2.10pm -2.40pm Strategies for Logic Programming Languages

M. Clavel, M. Bonacina, B. Gramlich, 2007 .

On Proving and Characterizing Operational Termination of Deterministic Conditional Rewrite Systems

B. Gramlich, Felix Schernhammer, 2007 .

Consistency of Recursive Definitions via Shallow Confluence of Non-Orthogonal Non-Terminating Conditional Term Rewriting Systems with any kind of Extra Variables

B. Gramlich, Claus-Peter Wirth, 2005 .

Extending First-order Uniication by Tractable Second-order Features

B. Gramlich, 2000 .

Towards Intelligent Inductive Proof

B. Gramlich, 2007 .

A Constructor-Based Approach toPositive / Negative-ConditionalEquational

B. Gramlich, C. Andy, 1994 .

Termination and confluence: properties of structured rewrite systems

Bernhard Gramlich, B. Gramlich, 1996 .

Modularity in term rewriting revisited

Bernhard Gramlich, B. Gramlich, 2012, Theor. Comput. Sci..

Confluence without Termination via Parallel Critical Pairs

Bernhard Gramlich, B. Gramlich, 1996, CAAP.

Realizing Monads in Interaction Nets via Generic Typed Rules

Bernhard Gramlich, Eugen Jiresch, B. Gramlich, 2012, TAMC.

Modular aspects of rewrite-based specifications

Bernhard Gramlich, B. Gramlich, 1997, WADT.

On Termination and Confluence Properties of Disjoint and Constructor-Sharing Conditional Rewrite Systems

Bernhard Gramlich, B. Gramlich, 1996, Theor. Comput. Sci..

A Structural Analysis of Modular Termination of Term Rewriting Systems

Bernhard Gramlich, B. Gramlich, 1991 .

A Constructor-Based Approach for Positive/Negative-Conditional Equational Specifications

Bernhard Gramlich, Claus-Peter Wirth, B. Gramlich, 1992, CTRS.

Strategic Issues, Problems and Challenges in Inductive Theorem Proving

Bernhard Gramlich, B. Gramlich, 2005, STRATEGIES@IJCAR.

Termination of Lazy Rewriting Revisited

Bernhard Gramlich, Felix Schernhammer, B. Gramlich, 2008, WRS@RDP.

Termination of Rewriting with and Automated Synthesis of Forbidden Patterns

Bernhard Gramlich, Felix Schernhammer, B. Gramlich, 2010, IWS.

Characterizing and proving operational termination of deterministic conditional term rewriting systems

Bernhard Gramlich, Felix Schernhammer, B. Gramlich, 2010, J. Log. Algebraic Methods Program..

Extending Context-Sensitivity in Term Rewriting

Bernhard Gramlich, Felix Schernhammer, B. Gramlich, 2010, WRS.

Transformations of Conditional Rewrite Systems Revisited

Bernhard Gramlich, Karl Gmeiner, B. Gramlich, 2009, WADT.

VMTL-A Modular Termination Laboratory

Bernhard Gramlich, Felix Schernhammer, B. Gramlich, 2009, RTA.

Generalizing Newman's Lemma for Left-Linear Rewrite Systems

Salvador Lucas, Bernhard Gramlich, Salvador Lucas, 2006, RTA.

Modular termination of context-sensitive rewriting

Salvador Lucas, Bernhard Gramlich, Salvador Lucas, 2002, PPDP '02.

Simple termination of context-sensitive rewriting

Salvador Lucas, Bernhard Gramlich, Salvador Lucas, 2002, RULE '02.

A Note on Minimal Counterexamples to Modularity of Termination ( Preliminary Version )

B. Gramlich, Klaus Györgyfalvay, 2012 .

On Soundness Conditions for Unraveling Deterministic Conditional Rewrite Systems

Bernhard Gramlich, Felix Schernhammer, Karl Gmeiner, 2012, RTA.

Automation of Mathematical Induction as part of the History of Logic pdf

J. Strother Moore, Claus-Peter Wirth, A. Bundy, 2013, FLAP.

Constructor-Based Inductive Validity in Positive/Negative-Conditional Equational Specifications

Bernhard Gramlich, Claus-Peter Wirth, Ulrich Kühler, 1993 .

Simple termination is difficult

Bernhard Gramlich, Aart Middeldorp, A. Middeldorp, 1993, Applicable Algebra in Engineering, Communication and Computing.

Abstract Relations between Restricted Termination and Confluence Properties of Rewrite Systems

Bernhard Gramlich, B. Gramlich, 1995, Fundam. Informaticae.

On Termination and Confluence of Conditional Rewrite Systems

Bernhard Gramlich, B. Gramlich, 1994, CTRS.

Generalized sufficient conditions for modular termination of rewriting

Bernhard Gramlich, B. Gramlich, 1992, Applicable Algebra in Engineering, Communication and Computing.

Relating Innermost, Weak, Uniform and Modular Termination of Term Rewriting Systems

Bernhard Gramlich, B. Gramlich, 1992, LPAR.

On (Un)Soundness of Unravelings

Bernhard Gramlich, Felix Schernhammer, Karl Gmeiner, 2010, RTA.

On Operational Termination of Deterministic Conditional Rewrite Systems

B. Gramlich, Felix Schernhammer, 2007 .

Simplifying termination proofs for rewrite systems by preprocessing

Bernhard Gramlich, B. Gramlich, 2000, PPDP '00.

Sufficient Conditions for Modular Termination of Conditional Term Rewriting Systems

Bernhard Gramlich, B. Gramlich, 1992, CTRS.

Suucient Conditions for Modular Termination of Conditional Term Rewriting Systems

Bernhard Gramlich, B. Gramlich, 1993 .

Algorithmic Aspects of Herbrand Models Represented by Ground Atoms with Ground Equations

Bernhard Gramlich, Reinhard Pichler, B. Gramlich, 2002, CADE.