A CHR-based Implementation of Known Arc-Consistency

Details A CHR-based Implementation of Known Arc-Consistency A CHR-based Implementation of Known Arc-Consistency

2004-08-24

arxiv.org/abs/cs/0408056v1

Computer Science

Logic in Computer Science

22 pages, 2 figures, 1 table To appear in Theory and Practice of Logic Programming (TPLP)

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A CHR-based Implementation of Known Arc-Consistency does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A CHR-based Implementation of Known Arc-Consistency, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A CHR-based Implementation of Known Arc-Consistency will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-249200