



Logical reasoning is one of the key characteristics of
intelligent behaviour of (most) humans.
To automate logical reasoning is an important research
area in the field of artificial intelligence. The core of this
research area is called automated theorem proving.
My research interests are
within the field of automated theorem proving. More details can
be found in my publications. Most of the
theoretical results presented in these papers have been implemented.
The source code of these programs can be found in the
theorem provers section.
Please feel free to contact me.
My research interest is focused on areas in automated theorem proving
that are related to one or more of the following topics:

connectionbased theorem proving: proof methods that are
based on the connection calculus.

nonclassical logics: proof methods that deal with,
e.g., intuitionistic logic, modal logics or linear logic.

nonclausal theorem proving: proof procedures that
work entirely on the original presentation of the given input.

lean theorem proving: implementation of provers that are
not only very compact but also have a strong performance.

program synthesis: using automated theorem provers
in the development of verifiably correct software.

proof presentation: presenting proofs found by automated
theorem provers in a readable form.

implementation of automated theorem provers, i.e.
showing that proof methods developed theoretically actually work.
Please contact me for more information or in case of questions.
