Integrating finite domain constraints and CLP with sets

Authors:
A. Dal Palú;A. Dovier;E. Pontelli;G. Rossi
Affiliations:
Università di Udine;Università di Udine;New Mexico State University;Università di Parma
Venue:
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
Year:
2003

Citing 9
Cited 5

Constraint satisfaction in logic programming

Constraint satisfaction in logic programming
Compilation of set terms in the logic data language (LDL)

Journal of Logic Programming
Implementation of subset-equational programs

Journal of Logic Programming
Introduction

Visual language theory
Sets and constraint logic programming

ACM Transactions on Programming Languages and Systems (TOPLAS)
Revisiting the Cardinality Operator and Introducing the Cardinality-Path Constraint Family

Proceedings of the 17th International Conference on Logic Programming
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
A general framework for lazy functional logic programming with algebraic polymorphic types

Theory and Practice of Logic Programming
Generalized arc consistency for global cardinality constraint

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1

javaset: declarative programming in Java with sets

Proceedings of the 1st conference on Computing frontiers
JSetL: a Java library for supporting declarative programming in Java

Software—Practice & Experience
Integrating Finite Domain and Set Constraints into a Set-based Constraint Language

Fundamenta Informaticae - Advances in Computational Logic (CIL C08)
Constraint logic programming

A 25-year perspective on logic programming
Integrating Finite Domain and Set Constraints into a Set-based Constraint Language

Fundamenta Informaticae - Advances in Computational Logic (CIL C08)

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we propose a semantically well-founded combination of the constraint solvers used in the constraint programming languages CLP(SET) and CLP(FD). This work demonstrates that it is possible to provide efficient executions (through CLP(FD) solvers) while maintaining the expressive power and flexibility of the CLP(SET) language. We develop a combined constraint solver and we show how static analysis can help in organizing the distribution of constraints to the two constraint solvers.