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, this assumption may lead to waste of computation time, or even to 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 to restart propagation after every acquisition. In this paper, we present a two sorted CLP language to express and solve ICSPs, and its implementation in the Constraint Handling Rules (CHR) language, a declarative language particularly suitable for high level implementation of constraint solvers.
A CHR-based implementation of known arc-consistency
ALBERTI, Marco;GAVANELLI, Marco;LAMMA, Evelina;
2005
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, this assumption may lead to waste of computation time, or even to 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 to restart propagation after every acquisition. In this paper, we present a two sorted CLP language to express and solve ICSPs, and its implementation in the Constraint Handling Rules (CHR) language, a declarative language particularly suitable for high level implementation of constraint solvers.I documenti in SFERA sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
