A generic arc-consistency algorithm and its specializations
Artificial Intelligence
A filtering algorithm for constraints of difference in CSPs
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Local and global relational consistency
Theoretical Computer Science - Special issue: principles and practice of constraint programming
A Sufficient Condition for Backtrack-Free Search
Journal of the ACM (JACM)
Enforcing Arc Consistency on Global Constraints by Solving Subproblems on the Fly
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
An Original Constraint Based Approach for Solving over Constrained Problems
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Improving domain filtering using restricted path consistency
CAIA '95 Proceedings of the 11th Conference on Artificial Intelligence for Applications
Theoretical analysis of singleton arc consistency and its extensions
Artificial Intelligence
Domain filtering consistencies for non-binary constraints
Artificial Intelligence
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
Heuristics for Dynamically Adapting Propagation
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Domain filtering consistencies
Journal of Artificial Intelligence Research
A study of residual supports in arc consistency
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Path consistency by dual consistency
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Neighborhood inverse consistency preprocessing
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Hi-index | 0.00 |
This article presents a generic scheme for adding strong local consistencies to the set of features of constraint solvers, which is notably applicable to event-based constraint solvers. We encapsulate a subset of constraints into a global constraint. This approach allows a solver to use different levels of consistency for different subsets of constraints in the same model. Moreover, we show how strong consistencies can be applied with different kinds of constraints, including user-defined constraints. We experiment our technique with a coarse-grained algorithm for Max-RPC, called Max-RPCrm, and a variant of it, L-Max-RPCrm. Experiments confirm the interest of strong consistencies for Constraint Programming tools.