A sufficient condition for backtrack-bounded search
Journal of the ACM (JACM)
Algorithms for testing the satisfiability of propositional formulae
Journal of Logic Programming
Fundamental properties of neighbourhood substitution in constraint satisfaction problems
Artificial Intelligence
Local and global relational consistency
Theoretical Computer Science - Special issue: principles and practice of constraint programming
Contradicting Conventional Wisdom in Constraint Satisfaction
PPCP '94 Proceedings of the Second International Workshop on Principles and Practice of Constraint Programming
Global Cut Framework for Removing Symmetries
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Constraint Processing
Principles of Constraint Programming
Principles of Constraint Programming
Domain filtering consistencies for non-binary constraints
Artificial Intelligence
A Decomposition Technique for Max-CSP
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Domain filtering consistencies
Journal of Artificial Intelligence Research
Using inferred disjunctive constraints to decompose constraint satisfaction problems
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
A study of residual supports in arc consistency
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Exploiting past and future: pruning by inconsistent partial state dominance
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Constraint Networks: Techniques and Algorithms
Constraint Networks: Techniques and Algorithms
Neighborhood inverse consistency preprocessing
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
| Hi-index | 0.00 |
In constraint satisfaction, basic inferences rely on some properties of constraint networks, called consistencies, that allow the identification of inconsistent 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.