Relation algebra and relview in practical use: construction of special university timetables

Authors:
Rudolf Berghammer;Britta Kehden
Affiliations:
Institut für Informatik, Christian-Albrechts-Universität Kiel, Kiel, Germany;Institut für Informatik, Christian-Albrechts-Universität Kiel, Kiel, Germany
Venue:
RelMiCS'08/AKA'08 Proceedings of the 10th international conference on Relational and kleene algebra methods in computer science, and 5th international conference on Applications of kleene algebra
Year:
2008

Citing 3
Cited 0

Implementation of Relational Algebra Using Binary Decision Diagrams

ReIMICS '01 Revised Papers from the 6th International Conference and 1st Workshop of COST Action 274 TARSKI on Relational Methods in Computer Science
RelView: an OBDD-based computer algebra system for relations

CASC'05 Proceedings of the 8th international conference on Computer Algebra in Scientific Computing
Evaluating sets of search points using relational algebra

RelMiCS'06/AKA'06 Proceedings of the 9th international conference on Relational Methods in Computer Science, and 4th international conference on Applications of Kleene Algebra

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we are concerned with a special timetabling problem. It was posed to us by the administration of our university and stems from the adoption of the British-American system of university education in Germany. This change led to the concrete task of constructing a timetable that enables the undergraduate education of secondary school teachers within three years in the "normal case" and within four years in the case of exceptional combinations of fields of study. We develop a relational model of the special timetabling problem and apply the REL VIEW tool to compute solutions.