When bounds consistency implies domain consistency for regular counting constraints

DOI10.1007/s10601-022-09333-0OpenAlexW4280648062MaRDI QIDQ2079264

Justin Pearson, Barnaby Martin

Publication date: 29 September 2022

Published in: Constraints (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10601-022-09333-0

zbMATH Keywords

consistencyautomata

Mathematics Subject Classification ID

Mathematical programming (90Cxx) Artificial intelligence (68Txx) Theory of computing (68Qxx)

Cites Work

• Using finite transducers for describing and synthesising structural time-series constraints
• Reformulation of global constraints based on constraints checkers
• A \texttt{cost-regular} based hybrid column generation approach
• Global constraint catalogue: past, present and future
• Sequencing and Counting with the multicost-regular Constraint
• Principles and Practice of Constraint Programming – CP 2004
• Principles and Practice of Constraint Programming – CP 2004

This page was built for publication: When bounds consistency implies domain consistency for regular counting constraints