When bounds consistency implies domain consistency for regular counting constraints

DOI10.1007/S10601-022-09333-0OpenAlexW4280648062MaRDI QIDQ2079264FDOQ2079264

Authors: Barnaby Martin, Justin Pearson 

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

Recommendations

• Regular Expressions with Numerical Constraints and Automata with Counters
• scientific article; zbMATH DE number 1487976
• Complete bound consistency for the global cardinality constraint
• On matrices, automata, and double counting in constraint programming
• An automaton constraint for local search

zbMATH Keywords

consistencyautomata

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (1)

• Range and Roots: two common patterns for specifying and propagating counting and occurrence constraints

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2079264)