This is my old research page. Please note that all of this information is out of date and that this page exists for historical reasons only.
I received my BSc in Computer Science and BEd in Computer Science and Mathematics from the University of Potsdam in 2008..
The preprocessor sbass detects and breaks symmetries in the search space of ASP instances by adding symmetry-breaking constraints.
A translational approach to Constraint Answer Set Solving was implemented in the prototypical preprocessor inca.
I also implemented the conflict-driven disjunctive Answer Set solver claspD. Visit the claspD project website for detailed information.
The preprocessor lnorm removes duplicate literals in rules of (disjunctive) logic programs.
Caparica-Prolog is an implementation of the programming language Prolog. It compiles logic programs into byte code and interprets it by a Warrens abstract machine with some optimisations, e.g., last call optimisation.