Narrowing the Gap between Set-Constraints and CLP(SET)-Constraints

We compare two (apparently) rather different set-based constraint languages, and we show that, in spite of their different origins and aims, there are large classes of constraint formulae for which both proposals provide suitable procedures for testing constraint satisfiability with respect to a given privileged interpretation. Specifically, we present a technique for reducing any set-constraint to a CLP(SET )-constraint; moreover, we show how the satisfiability check for some classes of set-constraints can be performed by the CLP(SET ) constraint solver.

• Type: Conference
• Year: 1998
• Where: AGP
• Authors: Agostino Dovier, Carla Piazza, Gianfranco Rossi
• Keywords: AGP 1998, Artificial Intelligence, Constraint Formulae, Constraint Solver, Testing Constraint Satisfiability