---
title: "A Generalized Arc-Consistency Algorithm for a Class of Counting Constraints"
authors:
  - "Thierry Petit"
  - "Nicolas Beldiceanu"
  - "Xavier Lorca"
doi: "10.5591/978-1-57735-516-8/IJCAI11-114"
url: "https://ijcai.org/proceedings/2011/114"
pdf: "https://ijcai.org/proceedings/2011/0114.pdf"
venue: "Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence"
year: 2011
pages: "643-647"
track: ""
keywords:
---

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

Thierry Petit, Nicolas Beldiceanu, Xavier Lorca

*Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence*, pages 643-647. DOI: [10.5591/978-1-57735-516-8/IJCAI11-114](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.