`Travelled to:`

2 × Japan

2 × The Netherlands

2 × United Kingdom

`Collaborated with:`

∅ A.Geser A.Middeldorp H.Zantema C.Claves C.Marché B.Bütow R.Giegerich S.Thesing

`Talks about:`

rewrit (4) relat (3) undecid (2) termin (2) reduct (2) condit (2) quasi (2) term (2) determinist (1) hierarchi (1)

## Person: Enno Ohlebusch

### DBLP: Ohlebusch:Enno

### Contributed to:

### Wrote 7 papers:

- RTA-2000-OhlebuschCM #analysis #logic programming #named #source code #termination
- TALP: A Tool for the Termination Analysis of Logic Programs (EO, CC, CM), pp. 270–273.
- FLOPS-1999-Ohlebusch #on the #term rewriting
- On Quasi-Reductive and Quasi-Simplifying Deterministic Conditional Rewrite Systems (EO), pp. 179–193.
- RTA-1998-Ohlebusch #equivalence #reduction #theorem
- Church-Rosser Theorems for Abstract Reduction Modulo an Equivalence Relation (EO), pp. 17–31.
- ALP-1997-Ohlebusch #graph grammar
- Conditional Term Graph Rewriting (EO), pp. 144–158.
- CSL-1996-GeserMOZ #term rewriting
- Relative Undecidability in Term Rewriting (AG, AM, EO, HZ), pp. 150–166.
- PLILP-1995-ButowGOT #semantics
- A New Strategy for Semantic Matching (BB, RG, EO, ST), pp. 81–96.
- TAPSOFT-1997-GeserMOZ #termination
- Relative Undecidability in the Termination Hierarchy of Single Rewrite Rules (AG, AM, EO, HZ), pp. 237–248.