The interests of our group in both, teaching and research, concentrate
on the development of efficient algorithms for different areas of
computer science and the comparison of the developed algorithms with
the theoretical optimum.
The area we are particularly interested in are rewrite systems and the
algorithms associated with them. So, in the center of our research is
on one side the development of tools that enhance the usability and
the efficiency of rewrite systems for several applications, as for
example in automated deduction and program verification and program
synthesis. On the other side we examine which algebraical structures
can be described by rewrite systems with special abilities in order to
find general limitations of rewrite systems. In more detail, we pursue
the following projects:
