Skip to Main content Skip to Navigation
Conference papers

Failed Value Consistencies for Constraint Satisfaction

Abstract : In constraint satisfaction, basic inferences rely on some properties of constraint networks, called consistencies, that allow the identification of incon- sistent instantiations (also called nogoods). Two main families of consistencies have been introduced so far: those that permit us to reason from variables such as (i, j)-consistency and those that permit us to reason from constraints such as relational (i, j)-consistency. This paper introduces a new family of consistencies based on the concept of failed value (a value pruned during search). This family is orthogonal to previous ones.
Document type :
Conference papers
Complete list of metadata

Cited literature [23 references]  Display  Hide  Download
Contributor : Francois Chevallier Connect in order to contact the contributor
Submitted on : Tuesday, September 24, 2013 - 12:14:24 PM
Last modification on : Wednesday, October 20, 2021 - 9:58:20 AM
Long-term archiving on: : Wednesday, December 25, 2013 - 4:33:11 AM


Files produced by the author(s)


  • HAL Id : hal-00865327, version 1



Christophe Lecoutre, Olivier Roussel. Failed Value Consistencies for Constraint Satisfaction. 15th International Conference on Principles and Practice of Constraint Programming (CP'09), 2009, Lisbon, Portugal. pp.554-568. ⟨hal-00865327⟩



Les métriques sont temporairement indisponibles