Searching for authors named "Christophe Lecoutre" – sorted by Relevance.
10 documents found, showing 1 through 10.
-
Bound consistencies for the discrete CSP
- …Abstract. Many works in the area of Constraint Programming have focused on inference, and more precisely, on filtering methods based on properties of constraint networks. Such properties are called domain filtering consistencies when they allow removing some inconsistent values from the domains of v…
- Cited by 1 (1 self) – Add To MetaCart
-
A study of residual supports in arc consistency
- …Abstract. In an Arc Consistency (AC) algorithm, a residual support, or residue, is a support that has been stored during a previous execution of the procedure which determines if a value is supported by a constraint. The point is that a residue is not guaranteed to represent a lower bound of the sma…
- Cited by 9 (6 self) – Add To MetaCart
-
Description and representation of the problems selected for the first international constraint satisfaction solver competition
- …Abstract. In this paper, we present the problems that have been selected for the first international competition of CSP solvers. First, we introduce a succinct description of each problem and then, we present the two formats that have been used to represent the CSP instances. 1…
- Cited by 8 (2 self) – Add To MetaCart
-
Exploiting Multidirectionality in Coarse-Grained Arc Consistency Algorithms
- …Arc consistency plays a central role in solving Constraint Satisfaction Problems. This is the reason why many algorithms have been proposed to establish it. Recently, an algorithm called AC2001 and AC3.1 has been independently presented by their authors. This algorithm which is considered as a re…
- Cited by 13 (7 self) – Add To MetaCart
-
Conservative Dual Consistency
- …Consistencies are properties of Constraint Networks (CNs) that can be exploited in order to make inferences. When a significant amount of such inferences can be performed, CNs are much easier to solve. In this paper, we interest ourselves in relation filtering consistencies for binary constraints, i…
- Cited by 2 (2 self) – Add To MetaCart
-
Nogood recording from restarts
- …In this paper, nogood recording is investigated within the randomization and restart framework. Our goal is to avoid the same situations to occur from one run to the next one. More precisely, nogoods are recorded when the current cutoff value is reached, i.e. before restarting the search algorithm. …
- Cited by 3 (2 self) – Add To MetaCart
-
Last conflict based reasoning
- …Abstract. In this paper, we propose an approach to guide search to sources of conflicts. The principle is the following: the last variable involved in the last conflict is selected in priority, as long as the constraint network can not be made consistent, in order to find the (most recent) culprit v…
- Cited by 3 (1 self) – Add To MetaCart
-
Extracting MUCs from constraint networks
- …Abstract. We address the problem of extracting Minimal Unsatisfiable Cores (MUCs) from constraint networks. This computationally hard problem has a practical interest in many application domains such as configuration, planning, diagnosis, etc. Indeed, identifying one or several disjoint MUCs can hel…
- Cited by 3 (1 self) – Add To MetaCart
-
A simple model to generate hard satisfiable instances
- …In this paper, we try to further demonstrate that the models of random CSP instances proposed by [Xu and Li, 2000; 2003] are of theoretical and practical interest. Indeed, these models, called RB and RD, present several nice features. First, it is quite easy to generate random instances of any arity…
- Cited by 11 (3 self) – Add To MetaCart
-
Preface
- …Proceedings of the…
- Add To MetaCart
Showing 1 through 10.
