Skip navigation
Skip navigation

Propagating regular counting constraints

Beldiceanu, Nicolas; Flener, P; Pearson, J; Van Hentenryck, Pascal


Constraints over finite sequences of variables are ubiquitous in sequencing and timetabling. This led to general modelling techniques and generic propagators, often based on deterministic finite automata (DFA) and their extensions. We consider counter-DFAs (cDFA). which provide concise models for regular counting constraints, that is constraints over the number of times a regular-language pattern occurs in a sequence. We show how to enforce domain consistency in polynomial time for at-most and...[Show more]

CollectionsANU Research Publications
Date published: 2014
Type: Conference paper
Source: Sequential Decision-Making with Big Data: Papers from the AAAI-14 Workshop


File Description SizeFormat Image
01_Beldiceanu_Propagating_regular_counting_2014.pdf886.26 kBAdobe PDF    Request a copy

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  23 August 2018/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator