Arc and path consistence revisited
Artificial Intelligence
Arc-consistency and arc-consistency again
Artificial Intelligence
Contradicting Conventional Wisdom in Constraint Satisfaction
PPCP '94 Proceedings of the Second International Workshop on Principles and Practice of Constraint Programming
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Constraint Processing
About the use of local consistency in solving CSPs
ICTAI '00 Proceedings of the 12th IEEE International Conference on Tools with Artificial Intelligence
Principles of Constraint Programming
Principles of Constraint Programming
Partition search for non-binary constraint satisfaction
Information Sciences: an International Journal
Theoretical analysis of singleton arc consistency and its extensions
Artificial Intelligence
Optimization of Simple Tabular Reduction for Table Constraints
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Domain filtering consistencies
Journal of Artificial Intelligence Research
IJCAI'77 Proceedings of the 5th international joint conference on Artificial intelligence - Volume 2
A study of residual supports in arc consistency
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Refining the basic constraint propagation algorithm
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Making AC-3 an optimal algorithm
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Optimal and suboptimal singleton arc consistency algorithms
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
A greedy approach to establish singleton arc consistency
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
An optimal coarse-grained arc consistency algorithm
Artificial Intelligence
Constraint Networks: Techniques and Algorithms
Constraint Networks: Techniques and Algorithms
Detecting and exploiting subproblem tractability
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.00 |
In this paper, we propose two original and efficient approaches for enforcing singleton arc consistency. In the first one, the data structures used to enforce arc consistency are shared between all subproblems where a domain is reduced to a singleton. This new algorithm is not optimal but it requires far less space and is often more efficient in practice than the optimal algorithm SAC-Opt. In the second approach, we perform several runs of a greedy search (where at each step, arc consistency is maintained), possibly detecting the singleton arc consistency of several values in one run. It is an original illustration of applying inference (i.e., establishing singleton arc consistency) by search. Using a greedy search allows benefiting from the incrementality of arc consistency, learning relevant information from conflicts and, potentially finding solution(s) during the inference process. We present extensive experiments that show the benefit of our two approaches.