BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Brazil
1 × Canada
1 × Denmark
1 × France
1 × Italy
1 × Japan
1 × Spain
1 × United Kingdom
3 × USA
Collaborated with:
∅ F.Schernhammer S.Lucas C.Wirth K.Gmeiner R.Pichler A.Middeldorp
Talks about:
termin (9) rewrit (7) system (5) condit (5) modular (4) confluenc (2) unravel (2) general (2) induct (2) ground (2)

Person: Bernhard Gramlich

DBLP DBLP: Gramlich:Bernhard

Facilitated 1 volumes:

IJCAR 2012Ed

Contributed to:

RTA 20122012
RTA 20102010
RTA 20092009
RTA 20062006
CADE 20022002
PPDP 20022002
PPDP 20002000
RTA 19961996
ALP 19941994
CADE 19941994
RTA 19931993
ALP 19921992
CADE 19901990

Wrote 14 papers:

RTA-2012-GmeinerGS #on the #term rewriting
On Soundness Conditions for Unraveling Deterministic Conditional Rewrite Systems (KG, BG, FS), pp. 193–208.
RTA-2010-GmeinerGS #on the
On (Un)Soundness of Unravelings (KG, BG, FS), pp. 119–134.
RTA-2009-SchernhammerG #composition #named #termination
VMTL — A Modular Termination Laboratory (FS, BG), pp. 285–294.
RTA-2006-GramlichL #linear #term rewriting
Generalizing Newman’s Lemma for Left-Linear Rewrite Systems (BG, SL), pp. 66–80.
CADE-2002-GramlichP #algorithm #aspect-oriented #equation #modelling
Algorithmic Aspects of Herbrand Models Represented by Ground Atoms with Ground Equations (BG, RP), pp. 241–259.
PPDP-2002-GramlichL #composition #termination
Modular termination of context-sensitive rewriting (BG, SL), pp. 50–61.
PPDP-2000-Gramlich #preprocessor #proving #term rewriting #termination
Simplifying termination proofs for rewrite systems by preprocessing (BG), pp. 139–150.
RTA-1996-Gramlich #on the #proving #termination
On Proving Termination by Innermost Termination (BG), pp. 93–107.
RTA-1996-GramlichW #confluence #revisited #term rewriting
Confluence of Terminating Conditional Rewrite Systems Revisited (BG, CPW), pp. 245–259.
ALP-1994-Gramlich #composition #confluence #on the #term rewriting #termination
On Modularity of Termination and Confluence Properties of Conditional Rewrite Systems (BG), pp. 186–203.
CADE-1994-WirthG #equation #induction #on the
On Notions of Inductive Validity for First-Oder Equational Clauses (CPW, BG), pp. 162–176.
RTA-1993-MiddeldorpG #termination
Simple Termination is Difficult (AM, BG), pp. 228–242.
ALP-1992-Gramlich #composition #termination
Generalized Sufficient Conditions for Modular Termination of Rewriting (BG), pp. 53–68.
CADE-1990-Gramlich #induction #named #proving #theorem proving
UNICOM: A Refined Completion Based Inductive Theorem Prover (BG), pp. 655–656.
Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.