This paper presents a new constraint domain, where variables can be assigned values that are organised in a tree hierarchy. The introduction of this new constraint domain is motivated by applications for the configuration of product and services, for instance, in the context of e-commerce. The paper proposes a small constraint language, based on comparisons and the use of monotonic functions. An approximation of domains as convex sets is detailed and propagation rules for achieving bound-consistency on the constraints are reviewed. This new constraint domain is general, and the author hopes that it will be a useful tool not only for solving configuration problems but also for promoting constraint technology in new application domains related to content classification or the semantic web.
[1]
Emmanuel Coquery,et al.
Subtyping Constraints in Quasi-lattices
,
2003,
FSTTCS.
[2]
Krzysztof R. Apt,et al.
From Chaotic Iteration to Constraint Propagation
,
1997,
ICALP.
[3]
Thomas R. Gruber,et al.
A translation approach to portable ontology specifications
,
1993,
Knowl. Acquis..
[4]
Robin Milner,et al.
On Observing Nondeterminism and Concurrency
,
1980,
ICALP.
[5]
Carmen Gervet,et al.
Interval propagation to reason about sets: Definition and implementation of a practical language
,
1997,
Constraints.
[6]
Frédéric Benhamou,et al.
Interval Constraint Logic Programming
,
1994,
Constraint Programming.
[7]
Joxan Jaffar,et al.
Constraint logic programming
,
1987,
POPL '87.