Sets and constraint logic programming

TLDR

CLP(SET) is a CLP framework instance that inherits the general features and theoretical results of the CLP scheme. The paper studies handling constraints formed by conjunctions of positive and negative literals using predicates =, ∈, ∪, and || in a finite‑set universe, and reviews and compares main techniques for representing finite sets in logic languages. Constraint algorithms are embedded in a CLP language that treats finite sets and basic set‑theoretic operations as first‑class objects, and programming examples illustrate its expressive power. Programming examples demonstrate the expressive power of CLP(SET) for manipulating finite sets.

Abstract

In this paper we present a study of the problem of handling constraints made by conjunctions of positive and negative literals based on the predicate symbols =, ∈,∪ and || (i.e., disjointness of two sets) in a (hybrid) universe of finite sets . We also review and compare the main techniques considered to represent finite sets in the context of logic languages. The resulting contraint algorithms are embedded in a Constraint Logic Programming (CLP) language which provides finite sets—along with basic set-theoretic operations—as first-class objects of the language. The language—called CLP( SET )—is an instance of the general CLP framework, and as such it inherits all the general features and theoretical results of this scheme. We provide, through programming examples, a taste of the expressive power offered by programming in CLP( SET ).