Optimal unification of bound simple set-terms
CIKM '96 Proceedings of the fifth international conference on Information and knowledge management
Sets and constraint logic programming
ACM Transactions on Programming Languages and Systems (TOPLAS)
Compiling High-Level Type Constructors in Constraint Programming
PADL '01 Proceedings of the Third International Symposium on Practical Aspects of Declarative Languages
CLPS-B - A Constraint Solver for B
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Cooperating Constraint Solvers
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Integrating finite domain constraints and CLP with sets
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
Dealing with incomplete knowledge on CLP(FD) variable domains
ACM Transactions on Programming Languages and Systems (TOPLAS)
Theory and Practice of Logic Programming
Multiparadigm Programming in Mozart/Oz: Second International Conference, MOZ 2004, Charleroi, Belgium, October 7-8, 2004, Revised Selected Papers (Lecture Notes in Computer Science)
JSetL: a Java library for supporting declarative programming in Java
Software—Practice & Experience
Cardinal: A Finite Sets Constraint Solver
Constraints
Principles of Constraint Programming
Principles of Constraint Programming
Numerica: a modeling language for global optimization
IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
Theory and Practice of Logic Programming - Prolog Systems
Hi-index | 0.00 |
This paper summarizes a constraint solving technique that is used to reason effectively in the scope of a set-based constraint language that supersedes existing finite domain languages. The first part of this paper motivates the presented work and introduces the constraint language, namely the language of Hereditarily Finite Sets (HFS). Then, the proposed constraint solver is detailed in terms of a set of rewrite rules that exploit finite domain reasoning within the HFS language. The proposed solution improves previous work on CLP (SET) [11] by integrating intervals into the constraint system and by providing a new layered architecture for the solver that supports more effective constraint solving strategies. On the other hand, the proposed approach provides enhanced expressivity and flexibility of domain representation than those usually found in existing finite domain constraint solvers.