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

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 …

We present the clp (FD) system: a constraint logic programming language with finite domain
constraints. We detail its implementation, and present an abstract instruction set for the …

We propose a transformation system for Constraint Logic Programming (CLP) aprograms
and modules. The framework is inspired by the one of Tamaki and Sato (1984) for pure logic …

We present an extensive, annotated bibliography of the abstract machines designed for
each of the main programming paradigms (imperative, object oriented, functional, logic and …

This article presents and illustrates a practical approach to the dataflow analysis of
constraint logic programming languages using abstract interpretation. It is first argued that …

Preference logic programming (PLP) is an extension of constraint logic pro-gramming (CLP)
for declaratively specifying problems requiring optimization or comparison and selection …

Central to constraint logic programming (CLP) languages is the notion of a global constraint
solver which is queried to direct execution and to which constraints are monotonically …

Thanks to Kim Marriott for inviting me to visit the Monash University of Melbourne. The month
I have spent there was of great inspiration. I have been fortunate to meet some exceptionally …

This paper presents an approach for universal left-termination of constraint logic programs,
based on approximations. An approximation is basically an algebraic morphism between …