Diploma/Master's/Bachelor's Theses and Job Offers

General Thesis Info

Submitted by stf on 7. October 2015 - 15:44
The following article summarizes some general information about theses at the Knowledge-Based Systems Group. That is, we'll discuss how to arrive at a topic and whom to talk to for the same.
Master's Thesis: Reasoning about Plausibility for the Winograd Schema Challenge [completed] Jens Claßen 4. May 2017 - 14:57

Bachelor's Thesis: Multi-Agent Simulation of the Water Quality in Megacities [completed]

Submitted by Martin Liebenberg on 12. January 2015 - 18:33


Humanity has crossed the line from being a rural to urban species since 2007. For the first time in history, more people live in cities and urban areas than in the countryside. Starting in the developed ations, where the urbanisation process has been significantly decelerated in the meantime, urbanisation has especially increased in Asia and South America as well as in Africa to a substantial extent in the second half of the last century. Processes of urbanisation have a negative influence on the availability and quality of water resources. Especially in developing and emerging countries, the hydrological and hydrogeological setting of each region is deteriorated through the growing urbanization processes. Often the hydrological and hydrogeological basis of an area is strongly affected by rocesses of urbanisation in these countries. Changes of the structure of urban development going along with the urbanisation will not be without consequences for the environment and water resources.

In frame of this background the Department of Engineering Geology and Hydrogeology of the RWTH Aachen University analysis the interaction between high speed urbanisation/mega-urbanisation and water resources in China and India. In context to this we want to develop a knowledge-based planning and simulation framework.

Bachelor's Thesis: Implementation and Evaluation of a Golog-based General Game Player [completed]

Submitted by Jens Claßen on 16. March 2014 - 19:00

The aim in General Game Playing (GGP) is to create programs called agents that are able to play a yet unknown game after they are given the rules. These programs must thus be as intelligent and as independent as possible to solve problems on their own. A similar research field is represented by Golog and the Situation-Calculus that are well-studied languages and allow reasoning about dynamic domains and diversified sets of problems.

All agents must be able to reason about actions. Hence one approach is to use the Situation-Calculus and Golog to represent games and to express strategies in such games. By introducing Golog to GGP we allow results and methods from both areas to be applied in GGP and vice versa. Accordingly we present an exemplary Golog setup and how to realize it in order to build a General Game Player. For this purpose we discuss how one can overcome the difficulties of translating a formalized game description to its corresponding Golog representation and show how simulations of games can be utilized with methods from Programming by Demonstration (PbD) in order to dynamically develop and maintain executable game strategies during runtime.

We show that our proof of concept agent GologPlayer is able to play turn-based games, supports most Game Description Language (GDL) features and show that it is able to beat randomly playing agents with a success rate of about 70%.

Diploma Thesis: Towards Decidable Verification of Non-Terminating Golog Programs [completed]

Submitted by Martin Liebenberg on 13. April 2013 - 20:45

Claßen and Lakemeyer recently introduced algorithms for the verification of temporal properties of non-terminating Golog programs, based on the first-order modal Situation Calculus variant ES, and regression-based reasoning. However, while Golog’s high expressiveness is a desirable feature, it also means that their verification procedures cannot be guaranteed to terminate in general. In this thesis, we address this problem by showing that, for a relevant subset, the verification of non-terminating Golog programs is indeed decidable, which is achieved by means of three restrictions. First, we use the ES variant of a decidable two-variable fragment of the Situation Calculus that was introduced by Gu and Soutchanski. Second, we have to restrict the Golog program to contain ground action only. Finally, we consider special classes of successor state axioms, namely the context-free ones and those that only admit local effects.