Work

Sets and constraint logic programming

Year: 2000

Type: article

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 ).

Source: ACM Transactions on Programming Languages and Systems

DOI: 10.1145/365151.365169

Authors: Agostino Dovier, Carla Piazza, Enrico Pontelli, Gianfranco Rossi

Institutions: University of Verona, University of Udine, New Mexico State University, University of Parma

Language: English

Topic: Logic, programming, and type systems

Subfield: Software

Field: Computer Science

Domain: Physical Sciences

Open Access status: bronze

Funder: National Science Foundation

Awards: Minority Institutions Infrastructure: Dynamic and Irregular Parallelism: Its Management in Symbolic and Scientific Computing, NSF-CNPq Collaborative Research: Implementation and Compilation of High-Performance, Scalable Parallel Constraint Programming Systems, CISE Research Instrumentation: Parallel and Distributed Constraint Programming Systems on Multiprocessor PCs: Implementations and Applications, Dynamic Data Structures in Advanced Programming Languages Implementation: Theory and Practice, CAREER: Parallel and distributed Constraint Programming: methodologies, applications, and educational opportunities