Exploiting Constraints for Domain Managing in CLP(FD)

Authors:
Marco Gavanelli;Evelina Lamma;Paola Mello;Michela Milano
Affiliations:
-;-;-;-
Venue:
FroCoS '02 Proceedings of the 4th International Workshop on Frontiers of Combining Systems
Year:
2002

Citing 9
Cited 0

Structure and interpretation of computer programs

Structure and interpretation of computer programs
Meta-level interpretation of CLP(Lists)

Constraint logic programming
Sets and constraint logic programming

ACM Transactions on Programming Languages and Systems (TOPLAS)
Mixed-initiative, multi-source information assistants

Proceedings of the 10th international conference on World Wide Web
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
Constraint satisfaction with delayed evaluation

IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 2
Lazy arc consistency

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

Constraint Logic Programming languages on Finite Domains CLP(FD) provide a declarative framework for dealing with problems in Artificial Intelligence (AI). However, in many applications, domains are not known at the beginning of the computation and must be computed. The domain computation can be time-consuming, since elements can be retrieved through an expensive acquisition process from the outer world. In this paper, we introduce a CLP language that treats domains as first-class objects, and allows the definition of domains through constraints in a CLP(FD) environment. We define operations and properties on variables and domains.The language can be implemented on top of different CLP systems, exploiting thus different semantics for domains. We state the specifications that the employed system should provide, and we show that two different CLP systems (Conjunto and {log}) can be effectively used.