On the minimality and global consistency of row-convex constraint networks
Journal of the ACM (JACM)
Path Consistency on Triangulated Constraint Graphs
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Simple randomized algorithms for tractable row and tree convex constraints
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Consistency and set intersection
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
| Hi-index | 0.00 |
Many interesting tractable problems are identified under the model of Constraint Satisfaction Problems. These problems are usually solved by forcing a certain level of local consistency. In this paper, for the class of connected row convex constraints, we propose a novel algorithm which is based on the ideas of variable elimination and efficient composition of row convex and connected constraints. Compared with the existing work including randomized algorithms, the new algorithm has better worst case time and space complexity.