| |
| 2003 | ||
|---|---|---|
| 8 | EE | Helko Lehmann, Michael Leuschel: Inductive Theorem Proving by Program Specialisation: Generating Proofs for Isabelle Using Ecce. LOPSTR 2003: 1-19 |
| 2000 | ||
| 7 | EE | Michael Leuschel, Helko Lehmann: Coverability of Reset Petri Nets and Other Well-Structured Transition Systems by Partial Deduction. Computational Logic 2000: 101-115 |
| 6 | EE | Helko Lehmann, Michael Leuschel: Decidability Results for the Propositional Fluent Calculus. Computational Logic 2000: 762-776 |
| 5 | EE | Helko Lehmann, Michael Leuschel: Solving Planning Problems by Partial Deduction. LPAR 2000: 451-468 |
| 4 | EE | Michael Leuschel, Helko Lehmann: Solving coverability problems of petri nets by partial deduction. PPDP 2000: 268-279 |
| 1998 | ||
| 3 | Yvonne Kalinke, Helko Lehmann: Computation in Recurrent Neural Networks: From Counters to Iterated Function Systems. Australian Joint Conference on Artificial Intelligence 1998: 179-190 | |
| 2 | Sven-Erik Bornscheuer, Helko Lehmann: On the Combination of Partial Action Descriptions. Australian Joint Conference on Artificial Intelligence 1998: 95-106 | |
| 1997 | ||
| 1 | Steffen Hölldobler, Yvonne Kalinke, Helko Lehmann: Designing a Counter: Another Case Study of Dynamics and Activation Landscapes in Recurrent Networks. KI 1997: 313-324 | |
| 1 | Sven-Erik Bornscheuer | [2] |
| 2 | Steffen Hölldobler | [1] |
| 3 | Yvonne Kalinke | [1] [3] |
| 4 | Michael Leuschel | [4] [5] [6] [7] [8] |