Programming with sets; an introduction to SETL
Programming with sets; an introduction to SETL
Embedding extensional finite sets in CLP
ILPS '93 Proceedings of the 1993 international symposium on Logic programming
Conjunto: constraint logic programming with finite set domains
ILPS '94 Proceedings of the 1994 International Symposium on Logic programming
Graph theory: An algorithmic approach (Computer science and applied mathematics)
Graph theory: An algorithmic approach (Computer science and applied mathematics)
Hi-index | 0.00 |
Extensional Set (XS) library is an extension of ECLiPSe which solves set-theoretical constraints over extensional sets containing variables with numeric domains. To efficiently process such a class of set domains, XS library employs a constraint programming method called Subdefinite Computations. Within that framework, a domain representation and an approximate unification algorithm are proposed. The abilities of the library are illustrated by a geometric application.