Proceedings

A Generalized Arc-Consistency Algorithm for a Class of Counting Constraints

Download BibTeX Cite

Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence. Pages 643-647.

https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-114

Abstract

This paper introduces the Seqbin meta-constraint with a polytime algorithm achieving generalized arc-consistency. Seqbin can be used for encoding counting constraints such as Change, Smooth, or InncreasingNValue. For all of them the time and space complexity is linear in the sum of domain sizes, which improves or equals the best known results of the literature.

Thierry Petit, Nicolas Beldiceanu, and Xavier Lorca. 2011. A Generalized Arc-Consistency Algorithm for a Class of Counting Constraints. In Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence, IJCAI-11. IJCAI, 643–647. https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-114
Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards