Negation and control in Prolog
Negation and control in Prolog
Programming with sets; an introduction to SETL
Programming with sets; an introduction to SETL
Unification in the data structure sets
Proc. of the 8th international conference on Automated deduction
Associative-commutative unification
Journal of Symbolic Computation
Three partition refinement algorithms
SIAM Journal on Computing
Unification in commutative idempotent monoids
Theoretical Computer Science
Journal of Symbolic Computation
Journal of Computer and System Sciences
Computable set theory
A rule-based language with functions and sets
ACM Transactions on Database Systems (TODS)
Set constructors in a logic database language
Journal of Logic Programming
The Z notation: a reference manual
The Z notation: a reference manual
Notes on implementing sets in Prolog
Communications of the ACM
Compilation of set terms in the logic data language (LDL)
Journal of Logic Programming
Programming by multiset transformation
Communications of the ACM
Complexity of unification problems with associative-commutative operators
Journal of Automated Reasoning
The Go¨del programming language
The Go¨del programming language
Embedding extensional finite sets in CLP
ILPS '93 Proceedings of the 1993 international symposium on Logic programming
Negation and constraint logic programming
Information and Computation
Unification in the union of disjoint equational theories: combining decision procedures
Journal of Symbolic Computation
The B-book: assigning programs to meanings
The B-book: assigning programs to meanings
An introduction to SequenceL: a language to experiment with constructs for processing nonscalars
Software—Practice & Experience
On the representation and management of finite sets in CLP languages
JICSLP'98 Proceedings of the 1998 joint international conference and symposium on Logic programming
A uniform axiomatic view of lists, multisets, and sets, and the relevant unification algorithms
Fundamenta Informaticae
Logic programming in Oz with Mozart
Proceedings of the 1999 international conference on Logic programming
A necessary condition for constructive negation in constraint logic programming
Information Processing Letters
An Efficient Unification Algorithm
ACM Transactions on Programming Languages and Systems (TOPLAS)
Proving termination with multiset orderings
Communications of the ACM
An Algorithm for General Set Unification and Its Complexity
Journal of Automated Reasoning
The SuRE Programming Framework
AMAST '95 Proceedings of the 4th International Conference on Algebraic Methodology and Software Technology
Comparing Expressiveness of Set Constructor Symbols
FroCoS '00 Proceedings of the Third International Workshop on Frontiers of Combining Systems
Exploiting Constraints for Domain Managing in CLP(FD)
FroCoS '02 Proceedings of the 4th International Workshop on Frontiers of Combining Systems
Multiset Constraints and P Systems
WMP '00 Proceedings of the Workshop on Multiset Processing: Multiset Processing, Mathematical, Computer Science, and Molecular Computing Points of View
Integrating finite domain constraints and CLP with sets
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
Disunification in ACI1 Theories
Constraints
javaset: declarative programming in Java with sets
Proceedings of the 1st conference on Computing frontiers
A logic-based framework for attribute based access control
Proceedings of the 2004 ACM workshop on Formal methods in security engineering
Dealing with incomplete knowledge on CLP(FD) variable domains
ACM Transactions on Programming Languages and Systems (TOPLAS)
Decidability results for sets with atoms
ACM Transactions on Computational Logic (TOCL)
Theory and Practice of Logic Programming
Deriving escape analysis by abstract interpretation
Higher-Order and Symbolic Computation
JSetL: a Java library for supporting declarative programming in Java
Software—Practice & Experience
A uniform approach to constraint-solving for lists, multisets, compact lists, and sets
ACM Transactions on Computational Logic (TOCL)
Access control policies and languages
International Journal of Computational Science and Engineering
Integrating Finite Domain and Set Constraints into a Set-based Constraint Language
Fundamenta Informaticae - Advances in Computational Logic (CIL C08)
A 25-year perspective on logic programming
Programming with partially specified aggregates in Java
Computer Languages, Systems and Structures
An abductive framework for information exchange in multi-agent systems
CLIMA IV'04 Proceedings of the 4th international conference on Computational Logic in Multi-Agent Systems
Policies, models, and languages for access control
DNIS'05 Proceedings of the 4th international conference on Databases in Networked Information Systems
Integrating Finite Domain and Set Constraints into a Set-based Constraint Language
Fundamenta Informaticae - Advances in Computational Logic (CIL C08)
| Hi-index | 0.00 |
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 &dvbm0; (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 .