Abstract Constraint Logic Programming (CLP) is a merger of two declarative paradigms:
constraint solving and logic programming. Although a relatively new field, CLP has …

Abstract Model merging conflicts occur when different stakeholders aim to integrate their
contradicting changes that are applied concurrently to update software models. We conduct …

Constraint Handling Rules (CHR) are our proposal to allow more flexibility and application-
oriented customization of constraint systems. CHR are a declarative language extension …

A constraint can be thought of intuitively as a restriction on a space of possibilities.
Mathematical constraints are precisely specifiable relations among several unknowns (or …

Temporal Constraint Networks (TCN) allow one to express minimal and maximal durations
between time-points. Although being used in many research areas, this model disregards …

We are investigating the use of a class of logical formulas to define constraint theories and
implement constraint solvers at the same time. The representation of constraint evaluation in …

Research on specification and scheduling of workflows has concentrated on temporal and
causality constraints, which specify existence and order dependencies among tasks …

Abstract Constraint Simplification Rules (CSR) is a subset of the Constraint Handling Rules
(CHR) language. CHR is a powerful special-purpose declarative programming language for …

Federated distributed systems present new challenges to resource management.
Conventional resource managers are based on a relatively static resource model and a …

Die Constraint-Programmierung liefert Methoden zur effizienten Modellierung von Systemen
oder zur Lösung von Problemstellungen, bei denen nur unvollständige Informationen …