A Strong Local Consistency for Constraint Satisfaction

Authors:
Romuald Debruyne
Affiliations:
-
Venue:
ICTAI '99 Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence
Year:
1999

Citing 10
Cited 4

A sufficient condition for backtrack-bounded search

Journal of the ACM (JACM)
Network-based heuristics for constraint-satisfaction problems

Artificial Intelligence
Arc-consistency and arc-consistency again

Artificial Intelligence
Backtrack Programming

Journal of the ACM (JACM)
Contradicting Conventional Wisdom in Constraint Satisfaction

PPCP '94 Proceedings of the Second International Workshop 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
Path Consistency Revisited

TAI '95 Proceedings of the Seventh International Conference on Tools with Artificial Intelligence
Two New Constraint Propagation Algorithms Requiring Small Space Complexity

ICTAI '96 Proceedings of the 8th International Conference on Tools with Artificial Intelligence
Using inference to reduce arc consistency computation

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Neighborhood inverse consistency preprocessing

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1

Conservative dual consistency

AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Domain filtering consistencies

Journal of Artificial Intelligence Research
Second-order consistencies

Journal of Artificial Intelligence Research
New algorithms for max restricted path consistency

Constraints

Quantified Score

Hi-index	0.00

Visualization

Abstract

Filtering techniques are essential to efficiently look for a solution in a constraint network (CN). However, for a long time it has been considered that to efficiently reduce the search space, the best choice is the limited local consistency achieved by forward checking [GB65,HE80]. However, more recent works [SF94,BR96,GS96] show that maintaining arc consistency (which is a more pruningful local consistency) during search outperforms forward checking on hard and large constraint networks. In this paper, we show that maintaining a local consistency stronger than arc consistency during search can be advantageous. According to the comparison of the local consistencies more pruningful than arc consistency that can be used on large CNs in [DE982], Max-restricted path consistency (Max-RPC, [DE97]) is one of the most promising local consistencies. We propose a new local consistency, called Max-RPCEn, that is stronger than Max-RPC and that has almost the same cpu time requirements.