Contributions to GUPU

GUPU is an environment specialized for Prolog programming courses.

During the last few years I have made a few contributions to this system.

Details of some contributions ("repetetive scheduling" and "ancestor example") are presented in this paper.

Contributions fall into one of the following categories.

New Student Assignments

Map-Coloring (2002-)

Repetetive Scheduling with Finite-Domain Constraints (1998-1999)

A finite-domain scheduling problem taken from Anton Ertl's master's thesis.

Reference Implementations

Map Coloring (2002-)

Ancestor Example (2001)

The system uses CHR (Constraint Handling Rules) to encode some properties of the relations occurring in the ancestor example.

It allows to detect inconsistencies between assertions (written by the student) and the intended meaning of the program.

Repetetive Scheduling (1998)

A reference implementation for a finite-domain scheduling example.

Problem-specific Viewers

Map Coloring (2002-)

Two viewers used in the context of a map-coloring assignment.

Both use this map of Vienna (the capitol of Austria).

Magic-Squares and N-Queens (2002, 2003)

Incremental viewers illustrating the pruning and propagating steps during the search process.

These viewers use the 'global constraints' interface of SICStus Prolog to reduce time and space requirements.

Repetetive Scheduling (1998)

A viewer displaying a solution to a finite-domain scheduling problem modelling repetitive scheduling.

Low-level Improvements

Labeling-Strategies for Solving Under-Constrained Finite-Domain Constraint-Systems (2002-)

These strategies can be useful in the context of graph/map-coloring.

Eye-friendly Animations in GUPU (2002)

Please look at these two pages for details. Eye-friendly Animations in XFree86. (Almost) Double-buffering for Ghostscript.