A New Approach to Computing Optimal Schedules for the Job-Shop Scheduling Problem
Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization
Partition-k-AC: An Efficient Filtering Technique Combining Domain Partition and Arc Consistency
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
Theoretical analysis of singleton arc consistency and its extensions
Artificial Intelligence
Domain filtering consistencies for non-binary constraints
Artificial Intelligence
Constraint-Level Advice for Shaving
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Inverse Consistencies for Non-binary Constraints
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Beyond Singleton Arc Consistency
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Heuristics for Dynamically Adapting Propagation
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
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Domain filtering consistencies
Journal of Artificial Intelligence Research
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
Journal of Artificial Intelligence Research
| Hi-index | 0.00 |
Consistencies are properties of constraint networks that can be enforced by appropriate algorithms to reduce the size of the search space to be explored. Recently, many consistencies built upon taking decisions (most often, variable assignments) and stronger than (generalized) arc consistency have been introduced. In this paper, our ambition is to present a clear picture of decision-based consistencies. We identify four general classes (or levels) of decision-based consistencies, denoted by SΔφ, EΔφ, BΔφ, and DΔφ, study their relationships, and show that known consistencies are particular cases of these classes. Interestingly, this general framework provides us with a better insight into decision-based consistencies, and allows us to derive many new consistencies that can be directly integrated and compared with other ones.