A CHR-based Implementation of Known Arc-Consistency

Simple item page
dc.creatorAlberti, Marco
dc.creatorGavanelli, Marco
dc.creatorLamma, Evelina
dc.creatorMello, Paola
dc.creatorMilano, Michela
dc.date2004-08-24
dc.date.accessioned2026-07-07T03:21:43Z
dc.date.available2026-07-07T03:21:43Z
dc.descriptionIn 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.
dc.description22 pages, 2 figures, 1 table To appear in Theory and Practice of Logic Programming (TPLP)
dc.identifierhttps://arxiv.org/abs/cs/0408056
dc.identifierhttp://arxiv.org/abs/cs/0408056
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/32308
dc.subjectLogic in Computer Science
dc.subjectArtificial Intelligence
dc.titleA CHR-based Implementation of Known Arc-Consistency
dc.typetext

Files

Collections

arXiv