P. Codognet and G. Nardiello. Enhancing the constraint-solving power of clp(FD) by means of path-consistency methods. In: Constraint Programming : Basics and Trends, A. Podelski (Ed.), LNCS 910, Springer Verlag 1995. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
An Open-Ended Finite Domain Constraint Solver - Mats Carlsson, Greger.. (1997) (50 citations) (Correct)
....performance. The indexical scheme can be readily extended, with for example conditional ranges [21,6] with foreach constructs as in our design, or with arbitrary functions written in C [9] A generalization of indexicals to m constraints encoding path consistency methods was proposed in [8]. Reification CLP(BNR) 16] was the first system to allow propositional combinations of arithmetic constraints by means of reification. This is now allowed by many systems including ours [21,12,22,17] Other systems provide blocking implication [10,25] or cardinality [25] Only research ....
Philippe Codognet and Giuseppe Nardiello. Enhancing the constraint-solving power of clp(FD) by means of path-consistency methods. In A. Podelski, editor, Constraints: Basics and Trends, volume 910 of Lecture Notes in Computer Science, pages 37--61. Springer-Verlag, 1995.
Constraint Based Reasoning with Constraint Logic Programming and.. - Turner (1996) (Correct)
....the hypergraph representation devolves to a normal graph for binary CSPs. Since most of the algorithms for attaining these levels of consistency operate on binary CSPs, we define them in terms of binary CSPs. The notions of hyperarc and hyperpath consistency have been conceived for general CSPs [8]. In addition, an algorithm, GAC4 [43] has been devised that enforces arc consistency for general CSPs. The simplest concept of consistency is that of node consistency. A constraint network is node consistent [52, p.57] if and only if for all variables the values in its domain satisfy the ....
P. Codognet and G. Nardiello. Enhancing the constraint solving power of clp(FD) by means of path consistency methods. In A. Podelski, editor, Constraint Programming: Basics and Trends, LNCS 910, pages 39--61. SpringerVerlag, 1994.
Constraint Retraction in CLP(FD): Formal Framework and.. - Georget, Codognet Self-citation (Codognet) (Correct)
.... rules describing how the domain of each variable is related to the domain of other variables, i.e. rules for describing node and arc consistency propagation (see [26, 19, 20, 28] for more details on CSPs and consistency algorithms) An extension to path consistency has also been proposed in [7]. We here only present the basic notions underlying the FD constraint system. In the following, we use the interval notation k 1 : k 2 , where k 1 and k 2 belong to a totally ordered set (in our case the integers) as a shorthand for the set fk 1 ; k 1 1; k 2 g. Definition 1 (Domain) A ....
P. Codognet and G. Nardiello. Enhancing the constraint-solving power of clp(FD) by means of path-consistency methods. In: Constraint Programming : Basics and Trends, A. Podelski (Ed.), LNCS 910, Springer Verlag 1995.
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