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

This article surveys the major developments in sequential Prolog implementation during the
period 1983–1993. In this decade, implementation technology has matured to such a …

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 …

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 …

Most existing libraries providing constraint facilities are embedded in the logic programming
language, Prolog, or in the object-oriented language, C++. Recently, some proposals have …

A brief overview of over-constrained systems | SpringerLink Skip to main content Advertisement
Springer Nature Link Account Menu Find a journal Publish with us Track your research Search …

We study in this paper the use of consistency techniques and local propagation methods,
originally developed for constraints over finite domains, for solving boolean constraints in …

Extended clauses are the basic formulas of the 0–1 constraint solver used in the constraint
logic programming language CLP (PB). We present a method for transforming an arbitrary …

Constraint Handling Rules (CHRs) are a high-level committed choice programming
language commonly used to write constraint solvers. While the semantic basis of CHRs …

A general approach to implement propagation and simplification of constraints consists of
applying rules over these constraints. However, a difficulty that arises frequently when …