{"type":"ScholarlyArticle","title":"A Generalized Arc-Consistency Algorithm for a Class of Counting Constraints","authors":[{"name":"Thierry Petit","slug":"thierry-petit","given":"Thierry","family":"Petit","affiliation":""},{"name":"Nicolas Beldiceanu","slug":"nicolas-beldiceanu","given":"Nicolas","family":"Beldiceanu","affiliation":""},{"name":"Xavier Lorca","slug":"xavier-lorca","given":"Xavier","family":"Lorca","affiliation":""}],"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.","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","markdown":"https://ijcai.org/proceedings/2011/114.md","bibtex":"https://ijcai.org/proceedings/2011/bibtex/114","volume":{"slug":"2011","title":"Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2011","url":"https://ijcai.org/proceedings/2011/","year":2011,"location":"Barcelona, Catalonia, Spain","dates":"16–22 July 2011","editors":"Toby Walsh","isbn":"978-1-57735-512-0; 978-1-57735-513-7; 978-1-57735-514-4; 978-1-57735-515-1; 978-1-57735-516-8","publisher":"AAAI Press/International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":114,"pages":{"first":643,"last":647},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}