Results 1 - 10 of 96

Correctness of Constraint Retraction Algorithms

by Romuald Debruyne, Gerard Ferrand, Narendra Jussien, Willy Lesaint, Samir Ouis, Alexandre Tessier, Et Alexandre Tessier , 2002
"... Using a ltering technique is crucial to reduce the search space. Most of the solvers (eg. chip, gnuProlog, Ilog solver, choco) use reduction operators and a propagation mechanism to enforce a local consistency. ..."
Abstract - Cited by 17 (8 self) - Add to MetaCart
Using a ltering technique is crucial to reduce the search space. Most of the solvers (eg. chip, gnuProlog, Ilog solver, choco) use reduction operators and a propagation mechanism to enforce a local consistency.

Constraint Retraction in FD

by Philippe Codognet, Daniel Diaz, Francesca Rossi , 1996
"... . The possibility of deleting a piece of information is very convenient in many programming frameworks. However, this feature is not available in constraint languages such as Constraint Logic Programming or Concurrent Constraint Programming, which allow only for a monotonic accumulation of constrain ..."
Abstract - Cited by 6 (2 self) - Add to MetaCart
. The possibility of deleting a piece of information is very convenient in many programming frameworks. However, this feature is not available in constraint languages such as Constraint Logic Programming or Concurrent Constraint Programming, which allow only for a monotonic accumulation

Implementing Constraint Retraction for Finite Domains

by Yan Georget, Philippe Codognet, Francesca Rossi - IN PROC. ASIAN'97. KATMANDU , 1997
"... Constraint retraction, while being certainly a very convenient feature in many situations, is usually not provided in current constraint programming environments. In this paper we describe how constraint retraction can be incorporated in the FD constraint solver and we evaluate its behavior wit ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
Constraint retraction, while being certainly a very convenient feature in many situations, is usually not provided in current constraint programming environments. In this paper we describe how constraint retraction can be incorporated in the FD constraint solver and we evaluate its behavior

W C 6 Correctness of Constraint Retraction Algorithms

by Romuald Debruyne, Gérard Ferr, Narendra Jussien, Willy Lesaint, Samir Ouis, Re Tessier
"... In this paper, we present a general scheme for incremental constraint retraction algorithms that encompasses all existing algorithms. Moreover, we introduce some necessary conditions to ensure the correctness of any new incremental constraint retraction algorithms. This rather theoretical work is ba ..."
Abstract - Add to MetaCart
In this paper, we present a general scheme for incremental constraint retraction algorithms that encompasses all existing algorithms. Moreover, we introduce some necessary conditions to ensure the correctness of any new incremental constraint retraction algorithms. This rather theoretical work

Correctness of Constraint Retraction Algorithms∗ Romuald Debruyne † and Gérard Ferrand

by Narendra Jussien, Willy Lesaint, Samir Ouis, Re Tessier
"... In this paper, we present a general scheme for incremental constraint retraction algorithms that encompasses all existing algorithms. Moreover, we introduce some necessary condi-tions to ensure the correctness of any new incremental con-straint retraction algorithms. This rather theoretical work is ..."
Abstract - Add to MetaCart
In this paper, we present a general scheme for incremental constraint retraction algorithms that encompasses all existing algorithms. Moreover, we introduce some necessary condi-tions to ensure the correctness of any new incremental con-straint retraction algorithms. This rather theoretical work

Constraint Retraction in CLP(FD): Formal Framework and Performance Results

by Yan Georget , Francesca Rossi, et al.
"... Constraint retraction can be described, in general, as the possibility of deleting a previously stated piece of information. This is obviously very convenient in many programming frameworks, especially in those that involve some level of interaction between the user and the system, or also in those ..."
Abstract - Cited by 9 (1 self) - Add to MetaCart
Constraint retraction can be described, in general, as the possibility of deleting a previously stated piece of information. This is obviously very convenient in many programming frameworks, especially in those that involve some level of interaction between the user and the system, or also

A new algorithm for maintaining arc consistency after constraint retraction

by Pavel Surynek, Roman Barták - In Principles and Practice of Constraint Programming , 2004
"... Abstract. Dynamic Constraint Satisfaction Problems play a very important role in modeling and solving real-life problems where the set of constraints is changing. The paper addresses a problem of maintaining arc consistency after removing a constraint from the constraint model. A new dynamic arc con ..."
Abstract - Cited by 4 (1 self) - Add to MetaCart
Abstract. Dynamic Constraint Satisfaction Problems play a very important role in modeling and solving real-life problems where the set of constraints is changing. The paper addresses a problem of maintaining arc consistency after removing a constraint from the constraint model. A new dynamic arc

Posting and Retracting Constraints in Cooperating Asynchronous Solvers

by Georg Ringwelski , 2002
"... We define a new incremental execution model for constraint satisfaction in concurrent imperative programming. Cooperating solvers restrict variable domains and detect inconsistecies by executing propagation and search algorithms asynchronously to the application program in which they were posted. No ..."
Abstract - Add to MetaCart
. Non-deterministic labeling-constraints, which implement arbitrary search algorithms, or interactive applications use constraint retraction to withdraw erroneous instantiations or to solve dynamic CSPs. The denotational semantics of such constraint programs is defined as the result of the Chaotic

RETRACTIONS TO PSEUDOFORESTS

by Tomás Feder, Pavol Hell, Peter Jonsson, Andrei Krokhin, Gustav Nordh
"... For a fixed graph H, let Ret(H) denote the problem of deciding whether a given input graph is retractable to H. We classify the complexity of Ret(H) when H is a graph (with loops allowed) where each connected component has at most one cycle, i.e., a pseudoforest. In particular, this result extends t ..."
Abstract - Cited by 6 (1 self) - Add to MetaCart
For a fixed graph H, let Ret(H) denote the problem of deciding whether a given input graph is retractable to H. We classify the complexity of Ret(H) when H is a graph (with loops allowed) where each connected component has at most one cycle, i.e., a pseudoforest. In particular, this result extends

NMCC Programming: Constraint Enforcement and Retraction in CC Programming

by Philippe Codognet, Francesca Rossi - in CC Programming. Proc. ICLP'95, 12th International Conference on Logic Programming , 1995
"... Among concurrent programming formalisms, CC programming can be pointed out for its elegant semantic analysis and for its declarativeness, but has monotonicity (of information accumulation in the common store) as one of its major drawbacks for practical use in reactive or open systems. Here we propos ..."
Abstract - Cited by 5 (1 self) - Add to MetaCart
propose a nonmonotonic extension of CC programming which provides the user with explicit nonmonotonic operations (remove(c) and enforce(c)), which can be used, respectively, to retract a constraint and to force its presence in the store (possibly eliminating inconsistencies with previously present
Results 1 - 10 of 96