`Travelled to:`

1 × Canada

1 × Germany

1 × Ireland

2 × Italy

2 × USA

`Collaborated with:`

J.Denzinger ∅ K.Madlener B.Löchner M.Fuchs J.Müller J.Steinbach U.Kühler T.Schmidt-Samoa C.Wirth B.Benninghofen R.Göbel T.Yamada C.Loría-Sáenz A.Middeldorp

`Talks about:`

theorem (4) rewrit (4) system (3) prove (3) equat (3) distribut (2) techniqu (2) complet (2) induct (2) effici (2)

## Person: Jürgen Avenhaus

### DBLP: Avenhaus:J=uuml=rgen

### Contributed to:

### Wrote 10 papers:

- IJCAR-2004-Avenhaus #algorithm #performance #permutation
- Efficient Algorithms for Computing Modulo Permutation Theories (JA), pp. 415–429.
- CADE-2003-AvenhausKSW #exclamation #how #induction #theorem
- How to Prove Inductive Theorems? QUODLIBET! (JA, UK, TSS, CPW), pp. 328–333.
- IJCAR-2001-AvenhausL #named #testing
- CCE: Testing Ground Joinability (JA, BL), pp. 658–662.
- RTA-1995-AvenhausDF #deduction #distributed #equation #named
- DISCOUNT: A SYstem for Distributed Equational Deduction (JA, JD, MF), pp. 397–402.
- RTA-1993-AvenhausD #equation #proving #theorem proving
- Distributing Equational Theorem Proving (JA, JD), pp. 62–76.
- RTA-1991-Avenhaus #equation #induction #proving #theorem
- Proving Equational and Inductive Theorems by Completion and Embedding Techniques (JA), pp. 361–373.
- RTA-1989-AvenhausDM #named #performance #proving #theorem proving
- THEOPOGLES — An efficient Theorem Prover based on Rewrite-Techniques (JA, JD, JM), pp. 538–541.
- RTA-1989-AvenhausMS #named #term rewriting
- COMTES — An Experimental Environment for the Completion of Term Rewriting Systems (JA, KM, JS), pp. 542–546.
- CADE-1986-AvenhausBGM #algebra #named #specification #term rewriting
- TRSPEC: A Term Rewriting Based System for Algebraic Specifications (JA, BB, RG, KM), pp. 665–667.
- TAPSOFT-1997-YamadaALM #term rewriting
- Logicality of Conditional Rewrite Systems (TY, JA, CLS, AM), pp. 141–152.