#### Filter Results:

- Full text PDF available (11)

#### Publication Year

1992

2006

- This year (0)
- Last 5 years (0)
- Last 10 years (0)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Klaus Schild, Jörg Würtz
- Constraints
- 2000

Thispaper introduces a new class of applications for constraint programming.This new type of application originates out of a special classof real-time systems, enjoying increasing popularity in… (More)

- Tobias Müller, Jörg Würtz
- WLP
- 1995

Constraint programming has been proved as an excellent tool to solve combinatori-al problems in many application areas. Through constraint propagation large parts of the search space can be pruned… (More)

- Martin Henz, Gert Smolka, Jörg Würtz
- IJCAI
- 1993

Oz is an experimental higher-order concurrent constraint programming system under development at DFKI. It combines ideas from logic and concurrent programming in a simple yet expressive language.… (More)

- Jörg Würtz, Tobias Müller
- KI
- 1996

Finite Domain Programming is a technique for solving com-binatorial problems like planning, scheduling, connguration or timetabling. Inevitably, these problems employ disjunctive constraints. A… (More)

- Klaus Schild, Jörg Würtz
- SAC
- 1998

This paper shows how a recently introduced class of applications can be solved by constraint programming. This new type of application is due to the emergence of special real-time systems, enjoying… (More)

- Martin Henz, Jörg Würtz
- PATAT
- 1995

In this paper, we concentrate on a typical scheduling problem: the computation of a timetable for a German college. Like many other scheduling problems, this problem contains a variety of complex… (More)

- Jörg Würtz
- ICTAI
- 1996

This paper describes the Oz Scheduler, a workbench for scheduling problems. Through a graphical interface, the user can freely combine the elements that define a scheduling strategy. Such elements… (More)

- Philippe Devienne, Patrick Lebègue, Anne Parrain, Jean-Christophe Routier, Jörg Würtz
- J. Log. Program.
- 1996

The simplest non{trivial program pattern in logic programming is the following one : 8 < : p(fact) : p(left) p(right) : p(goal) : where fact, goal, left and right are arbitrary terms. Because the… (More)

- Jörg Würtz
- 1998

In this doctoral dissertation we deal with combinatorial pr oblem solving by constraint programming. We show that a number of combinatorial problems can be e fficiently solved in the concurrent… (More)

- Jörg Würtz
- ECAI
- 1992

trum f ¨ ur K ¨ unstliche Intelligenz, DFKI) with sites in Kaiserslautern and Saarbrücken is a non-profit organization which was founded in 1988. The shareholder com-search projects conducted at the… (More)