Travelled to:
1 × Sweden
1 × United Kingdom
Collaborated with:
M.Leuschel
Talks about:
partial (2) deduct (2) petri (2) cover (2) net (2) specialis (1) structur (1) proposit (1) calculus (1) transit (1)
Person: Helko Lehmann
DBLP: Lehmann:Helko
Contributed to:
Wrote 4 papers:
- LOPSTR-2003-LehmannL #generative #induction #proving #theorem proving #using
- Inductive Theorem Proving by Program Specialisation: Generating Proofs for Isabelle Using Ecce (HL, ML), pp. 1–19.
- CL-2000-LehmannL #calculus #decidability
- Decidability Results for the Propositional Fluent Calculus (HL, ML), pp. 762–776.
- CL-2000-LeuschelL #deduction #petri net
- Coverability of Reset Petri Nets and Other Well-Structured Transition Systems by Partial Deduction (ML, HL), pp. 101–115.
- PPDP-2000-LeuschelL #deduction #petri net #problem
- Solving coverability problems of petri nets by partial deduction (ML, HL), pp. 268–279.