| Research
Interests |
| |
|
 |
Constraint
programming
Program analysis
Automatic generation of constraint solvers
Constraint reasoning
Innovative applications
&
Knwoledge representation
Automated theorem proving
Semantic Web |
 |
| |
|
| Research
Topics |
| |
|
| JCK
- Java Constraint Kit |
IB-BMBF/SCyT
Project ARG 030/98 INF: Java Constraint Kit, 1999-2002, project
leader since 2001.
The main goal of the joint project is to develop a Java-based
software tool for solving combinatorial, optimization and
planning problems using constraint technology. Towards this
end, we will implement a constraint logic programming kit
in the internet programming language Java. Our choice of Java
will allow easy implementation and wide-spread use of the
tool. The concrete target of the JCK project is to embed the
Constraint Handling Rules (CHR) into the JavaLog programming
language. CHR is a special language for the description of
constraint systems whereas JavaLog is an implementation of
Prolog in Java.
JCK - Java Constraint
Kit |
| |
|
| VisualCHR:
Visualization of Constraint Solvers |
VisualCHR
is a visual constraint programming tool for Constraint Handling
Rules (CHR). VisualCHR allows to visualize the propagation
of constraints. It supports the analysis of derivations as
produced by CHR. The primary purpose of VisualCHR was to support
developers of constraint solvers during the debugging stages.
But VisualCHR also supports the comparison of different constraint
solvers, or simply the illustration of the derivation process
to learn CHR.
More...,
Demo |
| |
|
| University
Lecture Timetabling |
Like
many other scheduling problems, the computation of a timetable
for the lectures in Computer Science at the University of
Munich contains a variety of complex constraints. The exponentiell
complexity of the problem was reduced by reusing as much as
possible the previous schedule. The implementation is based
on a constraint solver for finite domains written in Constraint
Handling Rules that was extended to cope with priorities among
value assignments to variables.
More..., Demo |
| |
|
| Nurse
Scheduling: INTERDIP |
INTREDIP
assists a human planer in scheduling the working shifts for
a nurse station. Typically, for 20 nurses and a period of
one month, it generates correct and fairly good plans within
minutes. It was possible to build this planing system for
nurse scheduling within a few man months using a given commercial
constraint solver, IF/Prolog from Siemens Nixdorf.
More... |
| |
|
| Classroom
Assignment |
| The
Classroom Assignment problem consists of scheduling a set
of courses into a fixed number of rooms, given a fixed timetable.
At the University of Munich, a classroom plan has to be created
each semester after collecting timetables of all departments
and wishes of teachers. This planning is very complex since
a lot of constraints have to be met, e.g. room size and equipment.
Using constraint-based programming, we developed a prototype,
called RoomPlan, that supports automatic creation of classroom
plans. With RoomPlan a schedule can be created interactively
within some minutes instead of some days. |
| |
| The
Munich Rent Advisor |
The
Munich Rent Advisor (MRA) is an intelligent Internet application
that allows calculating an estimate of the fair rent for a
flat in Munich. The MRA is the electronic version of the "Mietspiegel"
(MS) which is published regularly by the City of Munich. The
MRA was shown at SYSTEMS 96 and SYSTEMS 97 Computer Show in
Munich, Germany, October 1996 and featured in several newspaper
articles and AI watch.
More...,
Rent Calculation
using a re-implementation of the MRA in the high-level
purely functional language Haskell. |
