C. Gervet. Interval propagation to reason about sets: Definition and implementation of a practical language. Constraints, 1(3):191--244, 1997. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents
On a Constraint System for Lattice (Interval) Domains - Fernández, Hill (2001) (Correct)
....function . 56 2 Executing sequence in the problem of heart funcionality diagnose 59 iv 1 Introduction Constraint Logic Programming (CLP) systems support many different domains such as finite ranges of integers [10, 14] reals [29, 36, 38, 7] finite sets [39, 23] or the Booleans [15, 6] The type of the domain determines the nature of the constraints and the solvers used to solve them. In particular, the cardinalityofthe domain determines the constraint solving procedure so that existing CLP systems have distinct constraint solving methods for the finite ....
C. Gervet. Interval propagation to reason about sets: definition and implementation of a practical language. Constraints, 1(3):191--244, 1997.
A generic execution model for CLP(X)< - Fernandez, Hill (1998) (Correct)
....been applied to many different domains each with distinct algebraic structures. The type of the domain gives place to different instances of the CLP scheme such as CLP(FD) CLP on finite ranges of integers) COD96a] CLP( CLP on real domain) REF96] CLP(Sets) CLP on finite sets of elements) GER97] or CLP(Bool) CLP on boolean domain) COD96b] However, problems suitable for solving with constraints often have a natural formulation which use more than one domain or a domain other than the built in domains. Existing constraint systems (with some exceptions such as the CHR language [FR ....
....C g and (2)fd C g. In the solutions, d X denotes X 2 [white; white] and d X 22 denotes X 2 [black; black] for X = A; B or C. 5.4 Interval propagation to reason about sets This final example illustrates how minimum and maximum are defined when the ordering is partial (see Subsection 4. 1) GER97] describes a system for solving sets constraints. GER97] provides the three inference rules shown below to describe the cases when two distinct set domains (ranges) are applied to a single set variable or when the set domain (range) of a set variable is reduced to one value or is inconsistent : ....
[Article contains additional citation context not shown here]
GERVET C., Interval Propagation to Reason about Sets: Definition and Implementation of a Practical Language. In Constraints: An International Journal, Vol(1), Number 3, pps: 191-244, March 1997.
Practical Investigation of Constraints with Graph Views - Müller (Correct)
....also into account packaging material added by Constraint (2) The coloring of the bins is modeled by Constraint (4) The model is not quite correct as we will see later on. The Implementation of the Constraint Model. The implementation of the presented model is based on finite set constraints [9, 13], i.e. a set value is approximated by a lower bound set and a upper bound set. The constraint solver has been implemented by the procedure BinPacking: proc BinPacking Weights Capacity Sol The argument Weights is a list of pairs Id#Weight. The variable Capacity determines the maximum capacity ....
Carmen Gervet. Interval propagation to reason about sets: Definition and implementation of a practical language. Constraints, 1(3):191--244, 1997.
Configuration Of Labeled Trees Under Lexicalized Constraints And.. - Duchier (2000) (2 citations) (Correct)
....domain (FD) constraints have become a reasonably standard tool of the trade and are routinely used in computational linguistics applications. Set constraints, on the other hand, have remained largely unexploited even though they are available and well supported by modern constraint technology [12, 20, 18]. In our work, constraints on finite sets (FS) of integers have emerged as an especially elegant and computationally effective tool for such linguistics applications as parsing with a dependency grammar [4, 6] or solving dominance constraints [5, 8] for the treatment of discourse [7] parsing ....
Carmen Gervet. Interval propagation to reason about sets: Definition and implementation of a practical language. Constraints, 1(3):191--244, 1997.
Finite Set Constraints in Oz - Müller, Müller (Correct)
....difference n, disjointness k, etc. are non basic constraints C : C : B j C 1 C 2 j S = E j S 1 S 2 j S 1 kS 2 j : E : S 1 [S 2 j S 1 S 2 j S 1 nS 2 j : The set notation fa; bg always denotes a convex set. i.e. c 2 fa; bg whenever a c b. In the notation of [9], s S and S s appear as s 2 [ 0;S] and s 2 [S;U] respectively. Solved Forms. Every basic constraint B can easily be checked for satisfiability; further, if B is satisfiable, it can be brought into a solved form which contains for every set variable S the greatest (least) sets s glb (s ....
....sets into constraint logic programming. The various set constraint systems differ in syntax, i.e. in the set description language, and in the power of the constraint solving mechanism they provide. Let us briefly mention the general lines of the different approaches. For a thorough overview see [9, 28]. The simplest set constraint systems allow for the description of finite ground sets by enumeration of their elements f1;2;3g, f1; f (a) 2g, or f1;f2g;ff3ggg. Our approach belongs into this class, along with Gervet s CONJUNTO [8] the set constraint library of ECL i PS [6] and ILOG SOLVER ....
C. Gervet. Interval Propagation to Reason about Sets: Definition and Implementation of a Practical Language. Constraints, 1(2), 1997.
Practical Investigation of Constraints with Graph Views - Müller (Correct)
....also into account packaging material added by Constraint (2) The coloring of the bins is modeled by Constraint (4) The model is not quite correct as we will see later on. The Implementation of the Constraint Model The implementation of the presented model is based on finite set constraints [9, 15], i.e. a set value is approximated by a lower bound set and a upper bound set. The constraint solver has been implemented by the procedure BinPacking: proc BinPacking Weights Capacity Sol The argument Weights is a list of pairs Id#Weight. The variable Capacity determines the maximum capacity ....
Carmen Gervet. Interval propagation to reason about sets: Definition and implementation of a practical language. Constraints, 1(3):191--244, 1997.
Programming Constraint Services - Schulte (2002) (5 citations) (Correct)
....constraints proper and constraint services. Constraints Constraints are domain specific. They depend on the domain from which the values for the variables are taken. Popular domains for constraint programming are finite domains (the domain is a finite subset of the integers) 143] finite sets [40], trees [26] records [140] and real intervals [101] Essential for constraints is constraint propagation. Constraint propagation excludes values for variables that are in conflict with a constraint. A constraint that connects several variables propagates information between its variables. ....
Carmen Gervet. Interval propagation to reason about sets: Definition and implementation of a practical language. Constraints, 1(3):191--244, 1997.
Solving Set Partitioning Problems with Constraint Programming - Müller (1998) (1 citation) (Correct)
....our knowledge, the only work on solving SPPs with constraint programming without using an ILP solver has been done by Carmen Gervet. She proposed an SPP solver using set constraints and employing a demanding formal apparatus. Her solver operates on sets of sets which complicates the implementation [3, 5]. This work was the inspiration to develop a propagation algorithm based on index sets for a global set partitioning constraint (see Section 4) An SPP can be stated as follows: for a given finite ground set G (with cardinality m) and a set P of n subsets X j associated with costs C j , find a ....
Carmen Gervet. Interval Propagation to Reason about Sets: Definition and Implementation of a Practical Language. Constraints, 1(3), 1997.
Toward A General Language For The Specification Of.. - Abdulwahed Abbas.. (Correct)
....DEPICT 0.1 for CSPs. Focus herein is mainly on the what part, targeting mostly expressiveness. In order to achieve that, this paper resorts to the use of higher level constructs such as functions, relations, sets and types. At the moment, there are just a few languages (e.g. CLPS[3] CONJUNCTO[8] and OZ[14] that can formulate arbitrary constraints over sets, which is a source of enormous expressiveness. This paper concludes with a few insights on how to link the how to the what part. In fact, our vision is that the two parts can eventually be completely separated; that is, the user will ....
Gervet, C. Interval Propagation to reason about sets: Definition and Implementation of a practical language. Constraints 1(3), pp 194-244, 1997.
Global Reasoning on Sets - Sadler, Gervet (2001) (3 citations) Self-citation (Gervet) (Correct)
No context found.
C. Gervet. Interval propagation to reason about sets: Definition and implementation of a practical language. In E. Freuder, editor, CONSTRAINTS journal, volume 1(3), pages 191--244. 1997.
Views and Iterators for Generic Constraint - Implementations Christian Schulte (Correct)
No context found.
C. Gervet. Interval propagation to reason about sets: Definition and implementation of a practical language. Constraints, 1(3):191--244, 1997.
Constrained Metabolic Network Analysis: Discovering.. - Dooms, Deville, Dupont (2005) (Correct)
No context found.
Gervet, C.: Interval propagation to reason about sets: Definition and implementation of a practical language. CONSTRAINTS Journal 1(3) (1997) 191--244
CP(Graph): Introducing a Graph Computation Domain in.. - Dooms, Deville, Dupont (2005) (Correct)
No context found.
Gervet, C.: Interval propagation to reason about sets: Definition and implementation of a practical language. CONSTRAINTS Journal 1(3) (1997) 191--244
Constrained Path Finding in Biochemical Networks - Gregoire Dooms Yves (2004) (Correct)
No context found.
C. Gervet. Interval propagation to reason about sets: Definition and implementation of a practical language. CONSTRAINTS Journal, 1:191--244, 1997.
Branching: the Essence of Constraint Solving - Fernández, Hill (Correct)
No context found.
C. Gervet. Interval propagation to reason about sets: definition and implementation of a practical language. Constraints, 1(3):191--244, 1997.
A Chaotic Iteration View for Interval Constraint Solving.. - Fernández, Hill (Correct)
No context found.
Gervet C., Interval Propagation to Reason about Sets: Definition and Implementation of a Practical Language. In Constraints: An International Journal, 1(3):191-244, 1997.
A Constraint System for Lattice (Interval) Domains - Fernández, Hill (2001) (Correct)
No context found.
C. Gervet. Interval propagation to reason about sets: definition and implementation of a practical language. Constraints, 1(3):191--244, 1997.
A Language for Specifying Complete Timetabling Problems - Reis, Oliveira (Correct)
No context found.
Gervet, Carmen, Interval Propagation to Reason about Sets: Definition and Implementation of a Practical Language, Constraints, An International Journal, Vol. 1, pp. 191-246, 1997
A Generic Execution Model CLP(X) - Fernandez, Hill (1998) (Correct)
No context found.
GERVET C., Interval Propagation to Reason about Sets: Definition and Implementation of a Practical Language. In Constraints: An International Journal, Vol(1), Number 3, pps: 191-244, March 1997.
Global Constraints for Integer and Set Value Precedence - Law, Lee (Correct)
No context found.
C. Gervet. Interval propagation to reason about sets: Definition and implementation of a practical language. Constraints, 1(3):191--244, 1997.
Expressing Symmetry Breaking Constraints - Using Multiple Viewpoints (Correct)
No context found.
C. Gervet. Interval propagation to reason about sets: Definition and implementation of a practical language. Constraints, 1(3):191--244, 1997.
Disunification in ACI1 Theories - Dovier, Piazza, Pontelli (1999) (Correct)
No context found.
C. Gervet. Interval Propagation to Reason about Sets: Definition and Implementation of a Practical Language. Constraints, 1:191--246, 1997.
ACI1 constraints - Dovier, Piazza, Pontelli, Rossi (1999) (Correct)
No context found.
C. Gervet. Interval Propagation to Reason about Sets: Definition and Implementation of a Practical Language. Constraints, 1:191--246, 1997.
A Language for Specifying Complete Timetabling Problems - Reis, Oliveira (2000) (4 citations) (Correct)
No context found.
Gervet, Carmen, Interval Propagation to Reason about Sets: Definition and Implementation of a Practical Language, Constraints, An International Journal, Vol. 1, pp. 191-246, 1997
A Synthesis of Constraint Satisfaction and Constraint Solving - Maher (Correct)
No context found.
C. Gervet, Interval Propagation to Reason about Sets: Definition and Implementation of a Practical Language, Constraints 1(3): 191--244, 1997.
First 50 documents
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC