Bernhard Gramlich

54 papers A 5B 2C 3Journal 12Unranked 26
YearRankTypeTitle / Venue / Authors
2012 A ed.
Automated Reasoning - 6th International Joint Conference, IJCAR 2012, Manchester, UK, June 26-29, 2012. Proceedings
IJCAR
Bernhard Gramlich, Dale Miller, Uli Sattler
2012 J jnl
Modularity in term rewriting revisited.
Theor. Comput. Sci.
Bernhard Gramlich
2012 — conf
On Soundness Conditions for Unraveling Deterministic Conditional Rewrite Systems.
RTA
Karl Gmeiner, Bernhard Gramlich, Felix Schernhammer
2012 C conf
Realizing Monads in Interaction Nets via Generic Typed Rules.
TAMC
Eugen Jiresch, Bernhard Gramlich
2010 J jnl
Characterizing and proving operational termination of deterministic conditional term rewriting systems.
J. Log. Algebraic Methods Program.
Felix Schernhammer, Bernhard Gramlich
2010 — conf
On (Un)Soundness of Unravelings.
RTA
Karl Gmeiner, Bernhard Gramlich, Felix Schernhammer
2010 J jnl
On-demand strategy annotations revisited: An improved on-demand evaluation strategy.
Theor. Comput. Sci.
María Alpuente, Santiago Escobar, Bernhard Gramlich, Salvador Lucas
2010 — conf
Termination of Rewriting with and Automated Synthesis of Forbidden Patterns
IWS
Bernhard Gramlich, Felix Schernhammer
2009 — conf
Extending Context-Sensitivity in Term Rewriting
WRS
Bernhard Gramlich, Felix Schernhammer
2009 — conf
VMTL-A Modular Termination Laboratory.
RTA
Felix Schernhammer, Bernhard Gramlich
2008 — conf
Transformations of Conditional Rewrite Systems Revisited.
WADT
Karl Gmeiner, Bernhard Gramlich
2007 — conf
Termination of Lazy Rewriting Revisited.
WRS@RDP
Felix Schernhammer, Bernhard Gramlich
2006 — conf
A Framework for Timed Concurrent Constraint Programming with External Functions.
PROLE
María Alpuente, Bernhard Gramlich, Alicia Villanueva
2006 — conf
Generalizing Newman's Lemma for Left-Linear Rewrite Systems.
RTA
Bernhard Gramlich, Salvador Lucas
2005 — ed.
Frontiers of Combining Systems, 5th International Workshop, FroCoS 2005, Vienna, Austria, September 19-21, 2005, Proceedings
FroCoS
Bernhard Gramlich
2005 J jnl
Reduction strategies in rewriting and programming.
J. Symb. Comput.
Bernhard Gramlich, Salvador Lucas
2004 — conf
Strategic Issues, Problems and Challenges in Inductive Theorem Proving.
STRATEGIES@IJCAR
Bernhard Gramlich
2003 — ed.
3rd International Workshop on Reduction Strategies in Rewriting and Programming, WRS 2003, Valencia, Spain, June 8, 2003, Final Proceedings
WRS
Bernhard Gramlich, Salvador Lucas
2003 — conf
Preface: 3rd International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2003) - Final Proceedings.
WRS
Bernhard Gramlich, Salvador Lucas
2002 — ed.
2nd International Workshop on Reduction Strategies in Rewriting and Programming, WRS 2002, FLoC Satellite Event, Copenhagen, Denmark, July 21, 2002, Final Proceedings
WRS
Bernhard Gramlich, Salvador Lucas
2002 A conf
Algorithmic Aspects of Herbrand Models Represented by Ground Atoms with Ground Equations.
CADE
Bernhard Gramlich, Reinhard Pichler
2002 B conf
Improving On-Demand Strategy Annotations.
LPAR
María Alpuente, Santiago Escobar, Bernhard Gramlich, Salvador Lucas
2002 C conf
Modular termination of context-sensitive rewriting.
PPDP
Bernhard Gramlich, Salvador Lucas
2002 — conf
Preface.
WRS
Bernhard Gramlich, Salvador Lucas
2002 — conf
Simple termination of context-sensitive rewriting.
ACM SIGPLAN Workshop on Rule-Based Programming
Bernhard Gramlich, Salvador Lucas
2001 — conf
1st International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2001) - Preface.
WRS
Bernhard Gramlich, Salvador Lucas
2001 — ed.
1st International Workshop on Reduction Strategies in Rewriting and Programming, WRS 2001, Utrecht, The Netherlands, May 26, 2001
WRS
Bernhard Gramlich, Salvador Lucas
2001 — ed.
4th International Workshop on Strategies in Automated Deduction, STRATEGIES 2001, in connection with IJCAR 2001, Siena, Italy, June 18, 2001, Selected Papers
STRATEGIES@IJCAR
Maria Paola Bonacina, Bernhard Gramlich
2001 J jnl
On interreduction of semi-complete term rewriting systems.
Theor. Comput. Sci.
Bernhard Gramlich
2001 — conf
Preface: STRATEGIES 2001.
STRATEGIES@IJCAR
Maria Paola Bonacina, Bernhard Gramlich
2000 J jnl
Editorial: Strategies in Automated Deduction.
Ann. Math. Artif. Intell.
Bernhard Gramlich, Hélène Kirchner, Frank Pfenning
2000 C conf
Simplifying termination proofs for rewrite systems by preprocessing.
PPDP
Bernhard Gramlich
1997 — conf
Modular aspects of rewrite-based specifications.
WADT
Bernhard Gramlich
1996 — conf
Confluence of Terminating Conditional Rewrite Systems Revisited.
RTA
Bernhard Gramlich, Claus-Peter Wirth
1996 — conf
Confluence without Termination via Parallel Critical Pairs.
CAAP
Bernhard Gramlich
1996 — conf
On Proving Termination by Innermost Termination.
RTA
Bernhard Gramlich
1996 J jnl
On Termination and Confluence Properties of Disjoint and Constructor-Sharing Conditional Rewrite Systems.
Theor. Comput. Sci.
Bernhard Gramlich
1996 — —
Termination and confluence: properties of structured rewrite systems.
Bernhard Gramlich
1995 J jnl
Abstract Relations between Restricted Termination and Confluence Properties of Rewrite Systems.
Fundam. Informaticae
Bernhard Gramlich
1995 J jnl
Simple termination is difficult.
Appl. Algebra Eng. Commun. Comput.
Aart Middeldorp, Bernhard Gramlich
1994 J jnl
A Constructor-Based Approach to Positive/Negative-Conditional Equational Specifications.
J. Symb. Comput.
Claus-Peter Wirth, Bernhard Gramlich
1994 J jnl
A Note on a Parameterized Version of the Well-Founded Induction Pricible.
Bull. EATCS
Bernhard Gramlich
1994 J jnl
Generalized Sufficient Conditions for Modular Termination of Rewriting.
Appl. Algebra Eng. Commun. Comput.
Bernhard Gramlich
1994 — conf
On Modularity of Termination and Confluence Properties of Conditional Rewrite Systems.
ALP
Bernhard Gramlich
1994 A conf
On Notions of Inductive Validity for First-Oder Equational Clauses.
CADE
Claus-Peter Wirth, Bernhard Gramlich
1994 — conf
On Termination and Confluence of Conditional Rewrite Systems.
CTRS
Bernhard Gramlich
1993 — conf
Simple Termination is Difficult.
RTA
Aart Middeldorp, Bernhard Gramlich
1992 — conf
A Constructor-Based Approach for Positive/Negative-Conditional Equational Specifications.
CTRS
Claus-Peter Wirth, Bernhard Gramlich
1992 — conf
Generalized Sufficient Conditions for Modular Termination of Rewriting.
ALP
Bernhard Gramlich
1992 B conf
Relating Innermost, Weak, Uniform and Modular Termination of Term Rewriting Systems.
LPAR
Bernhard Gramlich
1992 — conf
Sufficient Conditions for Modular Termination of Conditional Term Rewriting Systems.
CTRS
Bernhard Gramlich
1990 A conf
Completion Based Inductive Theorem Proving: An Abstract Framework and its Applications.
ECAI
Bernhard Gramlich
1990 A conf
UNICOM: A Refined Completion Based Inductive Theorem Prover.
CADE
Bernhard Gramlich
1987 — conf
TRSPEC: A Term Rewriting Based System for Algebraic Specifications.
CTRS
Jürgen Avenhaus, Richard Göbel, Bernhard Gramlich, Klaus Madlener, Joachim Steinbach