## Conjunto: Constraint Logic Programming with Finite Set Domains (1994)

Venue: | Logic Programming - Proceedings of the 1994 International Symposium, pages 339--358, Massachusetts Institute of Technology |

Citations: | 47 - 1 self |

### BibTeX

@INPROCEEDINGS{Gervet94conjunto:constraint,

author = {Carmen Gervet},

title = {Conjunto: Constraint Logic Programming with Finite Set Domains},

booktitle = {Logic Programming - Proceedings of the 1994 International Symposium, pages 339--358, Massachusetts Institute of Technology},

year = {1994},

pages = {339--358},

publisher = {The MIT Press}

}

### Years of Citing Articles

### OpenURL

### Abstract

Combinatorial problems involving sets and relations are currently tackled by integer programming and expressed with vectors or matrices of 0-1 variables. This is efficient but not flexible and unnatural in problem formulation. Toward a natural programming of combinatorial problems based on sets, graphs or relations, we define a new CLP language with set constraints. This language Conjunto 1 aims at combining the declarative aspect of Prolog with the efficiency of constraint solving techniques. We propose to constrain a set variable to range over finite set domains specified by lower and upper bounds for set inclusion. Conjunto is based on the inclusion and disjointness constraints applied to set expressions which comprise the union, intersection and difference symbols. The main contribution herein is the constraint handler which performs constraint propagation by applying consistency techniques over set constraints. 1 Introduction Various systems of set constraints have been define...

### Citations

10964 |
Computers and Intractability: A Guide to the Theory of NP-Completeness
- Garey, Johnson
- 1979
(Show Context)
Citation Context ...s sufficient to solve such problems, and how set domains bring expressiveness and conciseness to the program. Problem description Bin packing problems belong to the class of set partitioning problems =-=[5]-=-. A multiset of n integers is given fw 1 ; :::; w n g and specifies the weight elements to partition. Another integer W max is given and represents the weight capacity. The aim is to find a partition ... |

1003 |
Consistency in networks of relations
- Mackworth
- 1977
(Show Context)
Citation Context ... 2 ` s 1 are two distinct constraints). This assumption simplifies the algorithm description but no restriction is actually imposed on real Conjunto programs. The definitions of node, arc consistency =-=[14]-=- and solved form [9] are kept and recalled hereafter. Definition 5.1 Let c(S) be a unary constraint (i.e, with one set variable) such that a set domain D s = glb s :: lub s is attached to S. c(S) is n... |

883 |
Rough Sets: Theoretical Aspects of Reasoning about Data
- Pawlak
- 1992
(Show Context)
Citation Context ...) " glb(Z) 4. lub(Y " Z) ` lub(Y ) " lub(Z) 5. glb(Y [ Z) ' glb(Y ) [ glb(Z) 6. lub(Y n Z) = lub(Y ) n glb(Z) 7. glb(Y n Z) = glb(Y ) n glb(Z) Proof The proof of the first five properti=-=es is given in [15]. To demon-=-strate 6. and 7., assume X and Y are set variables whose domains are respectively specified by glb(X) :: lub(X), glb(Y ) :: lub(Y ). 6. x 2 lub(X n Y ) iff fxg " X n Y 6= fg iff fxg " X 6= f... |

786 | Constraint logic programming
- Jaffar, Lassez
- 1987
(Show Context)
Citation Context ...foundations of Conjunto we need to define its operational semantics comprising the consistency algorithms. 5 Operational semantics for set constraints Conjunto does not fit to the standard CLP scheme =-=[11]-=- as the operational semantics is based on the notions of postponing some constraints and propagating other constraints whose satisfiability is not always provable. The solver schedules in a data-drive... |

384 |
Incremental constraint satisfaction in logic programming
- Hentenryck
- 1989
(Show Context)
Citation Context ...nguage is founded on the set notion of sets of finite depth over Herbrand terms (simple sets are sets of depth one). The satisfaction of constraints is performed using consistency checking techniques =-=[8]-=- over set elements defined as domain variables. Completeness is guaranteed at an exponential cost in the number of set elements by computing a tensorial product which builds the set of all the possibl... |

190 | A Generic Arc Consistency Algorithm and its Specializations - Hentenryck, Deville, et al. - 1992 |

78 |
Solving Systems of Set Constraints
- Aiken, Wimmers
- 1992
(Show Context)
Citation Context ...es such as axiomatizing a set theory in flogg [4], prototyping combinatorial problems with sets, multisets and sequences in CLPS[13], manipulating strings in CLP(\Sigma ) [16], analyzing programs [7] =-=[1]-=- [2] among others. According to the objectives aimed at, each of these languages proposes a constraint solver for a class of set constraints over a computation domain. The motivation for Conjunto orig... |

78 |
A Language and a Program for Stating and Solving Combinatorial Problems
- Lauriere, L
- 1978
(Show Context)
Citation Context ...aphs. In fact, our objectives are not limited to the definition of set domains but also aim at describing relations in the same way. Lauri`ere first addressed this issue in his seminal language ALICE =-=[12]-=-. In Conjunto, a finite relation domain constrains a relation variable R ` S 1 \Theta S 2 where S 1 and S 2 are respectively the domain and the range of R (ground sets). A graph is a specific relation... |

69 | Set constraints are the monadic class
- Bachmair, Ganzinger, et al.
- 1993
(Show Context)
Citation Context ...uch as axiomatizing a set theory in flogg [4], prototyping combinatorial problems with sets, multisets and sequences in CLPS[13], manipulating strings in CLP(\Sigma ) [16], analyzing programs [7] [1] =-=[2]-=- among others. According to the objectives aimed at, each of these languages proposes a constraint solver for a class of set constraints over a computation domain. The motivation for Conjunto originat... |

51 | A decision procedure for a class of set constraints
- Heintze, Jaffar
- 1990
(Show Context)
Citation Context ...rposes such as axiomatizing a set theory in flogg [4], prototyping combinatorial problems with sets, multisets and sequences in CLPS[13], manipulating strings in CLP(\Sigma ) [16], analyzing programs =-=[7]-=- [1] [2] among others. According to the objectives aimed at, each of these languages proposes a constraint solver for a class of set constraints over a computation domain. The motivation for Conjunto ... |

24 |
et al., A Compendium of Continuous Lattices
- Gierz
- 1980
(Show Context)
Citation Context ... j S 1 [ S 2 j S 1 " S 2 j S 1 n S 2 . A set expression is composed of set domain variables together with set operator symbols. The domain of a set expression is also a finite lattice under inclu=-=sion [6]-=-. It could be represented by computing its exact bounds at an exponential cost in the size of the largest upper bound invoked. But for efficiency reasons, it is represented in Conjunto by approximatin... |

18 |
Operational Semantics of Constraint Logic Programming over Finite Domains
- Hentenryck, Deville
- 1991
(Show Context)
Citation Context ...variables are solved by applying consistency techniques which allow to perform deterministic computations until we reach a fixed point. This approach can be seen as an adaptation of finite domains [3]=-=[9]-=- to finite set domains where the number of elements of the domain is no longer linear but exponential in the size of the upper bound and where the order relation is not total (!) but partial (`). As a... |

16 |
Short overview of the CLPS system
- Legeard, Legros
- 1991
(Show Context)
Citation Context ...oduction Various systems of set constraints have been defined for purposes such as axiomatizing a set theory in flogg [4], prototyping combinatorial problems with sets, multisets and sequences in CLPS=-=[13]-=-, manipulating strings in CLP(\Sigma ) [16], analyzing programs [7] [1] [2] among others. According to the objectives aimed at, each of these languages proposes a constraint solver for a class of set ... |

16 |
CLP(�∗ ): Constraint logic programming with regular sets
- WALINSKY
- 1989
(Show Context)
Citation Context ... have been defined for purposes such as axiomatizing a set theory in flogg [4], prototyping combinatorial problems with sets, multisets and sequences in CLPS[13], manipulating strings in CLP(\Sigma ) =-=[16]-=-, analyzing programs [7] [1] [2] among others. According to the objectives aimed at, each of these languages proposes a constraint solver for a class of set constraints over a computation domain. The ... |

12 |
Embedding Extensional Finite Sets
- Dovier, Rossi
- 1993
(Show Context)
Citation Context ...traint propagation by applying consistency techniques over set constraints. 1 Introduction Various systems of set constraints have been defined for purposes such as axiomatizing a set theory in flogg =-=[4]-=-, prototyping combinatorial problems with sets, multisets and sequences in CLPS[13], manipulating strings in CLP(\Sigma ) [16], analyzing programs [7] [1] [2] among others. According to the objectives... |

6 |
Hentenryck et al. The Constraint Logic Programming Language CHIP
- Dincbas, Simonis, et al.
- 1988
(Show Context)
Citation Context ...in variables are solved by applying consistency techniques which allow to perform deterministic computations until we reach a fixed point. This approach can be seen as an adaptation of finite domains =-=[3]-=-[9] to finite set domains where the number of elements of the domain is no longer linear but exponential in the size of the upper bound and where the order relation is not total (!) but partial (`). A... |