Hi there. This is the research page of Hendrik Maryns. From 2005 until 2008 I worked at the Eberhard Karls Universität Tübingen. Here is some information on what I did there. As you can see, it is rarely updated now.
In my time at the SFB441 at the Universität Tübingen, I wrote a query tool for linguistic tree banks. The goal was to write a query tool which can handle queries of some formalism stronger than first order logic.
Since I am no longer employed at the university, development on MonaSearch has stalled. If anyone is interested in continuing development, feel free to contact me for getting started.
The approach is to use results of the 70s to convert an MSO formula into a tree automaton, and to use those tree automata to query the trees.
I did some work for the department Logik und Sprachtheorie at the Wilhelm Schickard-Institut für Informatik, also at Universität Tübingen, on the work of Paul Hertz, a physician, logician and philosopher of the early 20th century, and the relevance of his logical work to current-day mathematical logic. Unfortunately, my ideas haven’t ripened into something publishable, and the world now asks other things from me. Ask if interested, though.
My general bibliography file is used in compiling most of the above.
I am ever and always grateful for any, be it tiny, correction to any of the above files.
The university logo and other common images are used in the slide shows.
In the process of writing the above tool, some modules came into existence which I believe might be interesting. These might be outdated, please contact me for newer versions if you would like to use them.
The formula module of the query tool program. Designed to handle MSO formulas, but also
useful for first order logic formulas.
Some classes that perform combinatoric operations, such as computing
all permutations of a list, or the Cartesian product of a