Arc and path consistence revisited
Artificial Intelligence
Constraint satisfaction algorithms
Computational Intelligence
A generic arc-consistency algorithm and its specializations
Artificial Intelligence
Arc-consistency and arc-consistency again
Artificial Intelligence
Constraint satisfaction with delayed evaluation
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 2
Using inference to reduce arc consistency computation
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
On the conversion between non-binary constraint satisfaction problems
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Solution Techniques for Constraint Satisfaction Problems: Foundations
Artificial Intelligence Review
Radio Link Frequency Assignment
Constraints
Exploiting Constraints for Domain Managing in CLP(FD)
FroCoS '02 Proceedings of the 4th International Workshop on Frontiers of Combining Systems
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Modular lazy search for Constraint Satisfaction Problems
Journal of Functional Programming
Cyclic consistency: a local reduction operation for binary valued constraints
Artificial Intelligence
Dealing with incomplete knowledge on CLP(FD) variable domains
ACM Transactions on Programming Languages and Systems (TOPLAS)
A CHR-based implementation of known arc-consistency
Theory and Practice of Logic Programming
Domain filtering consistencies
Journal of Artificial Intelligence Research
Propagate the right thing: how preferences can speed-up constraint solving
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Detecting unsatisfiable CSPs by coloring the micro-structure
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
| Hi-index | 0.00 |
Arc consistency filtering is widely used in the framework of binary constraint satisfaction problems: with a low complexity inconsistency may be detected and domains are filtered. In this paper, we show that when detecting inconsistency is the objective, a systematic domain filtering is useless and a lazy approach is more adequate. Whereas usual arc consistency algorithms produce the maximum arc consistent subdomain, when it exists, we propose a method, called LAC7, which only looks for any arc consistent sub-domain. The algorithm is then extended to provide the additional service of locating one variable with a minimum domain cardinality in the maximum arc consistent sub-domain, without necessarily computing all domain sizes. Finally, we compare traditional AC enforcing and lazy AC enforcing using several benchmark problems, both randomly generated CSP and real life problems.