A CHR-based Implementation of Known Arc-Consistency

TL;DR

This paper presents a CHR-based implementation of a solver for Interactive Constraint Satisfaction Problems (ICSPs), enabling constraint propagation with partially known domains to improve efficiency in dynamic environments.

Contribution

It introduces a novel implementation of an ICSP solver in CHR, extending classical CLP(FD) systems to handle partially known domains efficiently.

Findings

Efficient constraint propagation with incomplete domain knowledge.

Implementation demonstrates practical viability of ICSP in CHR.

Enhances flexibility of constraint solvers in dynamic environments.

Abstract

In classical CLP(FD) systems, domains of variables are completely known at the beginning of the constraint propagation process. However, in systems interacting with an external environment, acquiring the whole domains of variables before the beginning of constraint propagation may cause waste of computation time, or even obsolescence of the acquired data at the time of use. For such cases, the Interactive Constraint Satisfaction Problem (ICSP) model has been proposed as an extension of the CSP model, to make it possible to start constraint propagation even when domains are not fully known, performing acquisition of domain elements only when necessary, and without the need for restarting the propagation after every acquisition. In this paper, we show how a solver for the two sorted CLP language, defined in previous work, to express ICSPs, has been implemented in the Constraint Handling Rules (CHR) language, a declarative language particularly suitable for high level implementation of constraint solvers.