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
A Strong Local Consistency for Constraint Satisfaction
ICTAI '99 Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence
Theoretical analysis of singleton arc consistency and its extensions
Artificial Intelligence
Domain filtering consistencies for non-binary constraints
Artificial Intelligence
Domain filtering consistencies
Journal of Artificial Intelligence Research
Local consistency for extended CSPs
Theoretical Computer Science
Optimal and suboptimal singleton arc consistency algorithms
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Integrating strong local consistencies into constraint solvers
CSCLP'09 Proceedings of the 14th Annual ERCIM international conference on Constraint solving and constraint logic programming
Journal of Artificial Intelligence Research
| Hi-index | 0.00 |
This paper introduces a new level of partial consistency for constraint satisfaction problems, which is situated between arc and path-consistency. We call this level restricted path-consistency (RPC). Two procedures to enforce complete and partial RPC are presented. They both use path-based verifications to detect inconsistencies but retain the good features of arc-consistency since they only touch the variables domains and do not augment the connectivity of the constraint graph. We show that, although they perform a limited number of checks, these procedures exhibit a considerable pruning power.