Intensional Sets in CLP.
Agostino Dovier, Enrico Pontelli, Gianfranco Rossi · APPIA-GULP-PRODE · 2003
We propose a parametric introduction of intensionally defined sets into any \(CLP(\mathcal \{D\})\) language. The result is a language \(CLP({\mathcal \{D\}})\), where constraints over sets of elements of \(\mathcal D\) and over sets of sets of elements, and so on, can be expressed. The semantics of \(CLP({\mathcal \{D\}})\) is based on the semantics of logic programs with aggregates and the semantics of CLP over sets. We investigate the problem of constraint resolution in \(CLP({\mathcal \{D\}})\) and propose algorithms for constraints simplification.