Concurrent prolog: collected papers
Concurrent prolog: collected papers
The family of concurrent logic programming languages
ACM Computing Surveys (CSUR)
Embedding extensional finite sets in CLP
ILPS '93 Proceedings of the 1993 international symposium on Logic programming
From eager to lazy constrained data acquisition: a general framework
New Generation Computing
JELIA '96 Proceedings of the European Workshop on Logics in Artificial Intelligence
Constraint Propagation and Value Acquisition: Why we should do it Interactively
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Least Commitment on Variable Binding in Presence of Incomplete Knowledge
ECP '99 Proceedings of the 5th European Conference on Planning: Recent Advances in AI Planning
A classification and constraint-based framework for configuration
Artificial Intelligence for Engineering Design, Analysis and Manufacturing
Dealing with incomplete knowledge on CLP(FD) variable domains
ACM Transactions on Programming Languages and Systems (TOPLAS)
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Dealing with incomplete knowledge on CLP(FD) variable domains
ACM Transactions on Programming Languages and Systems (TOPLAS)
Partially defined constraints in constraint-based design
Artificial Intelligence for Engineering Design, Analysis and Manufacturing
| Hi-index | 0.00 |
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 (Cucchiara et al. 1999a) 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 (Gavanelli et al. 2005) 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.