Regular constraint

Last updated December 03, 2025

In artificial intelligence and operations research, a regular constraint^[1] is a kind of global constraint. It can be used to solve a particular type of puzzle called a nonogram or logigrams^{[ check spelling ]}.

References

↑ Hague, Matthew; Jeż, Artur; Lin, Anthony Widjaja; Markgraf, Oliver; Rümmer, Philipp (9 October 2025). "The Power of Regular Constraint Propagation". dl.acm.org. ACM Digital Library. pp. 387:3203–387:3231. doi:10.1145/3763165 . Retrieved 2 December 2025.

This artificial intelligence-related article is a stub. You can help Wikipedia by expanding it.

This applied mathematics–related article is a stub. You can help Wikipedia by expanding it.

This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.

[1] Hague, Matthew; Jeż, Artur; Lin, Anthony Widjaja; Markgraf, Oliver; Rümmer, Philipp (9 October 2025). "The Power of Regular Constraint Propagation". dl.acm.org. ACM Digital Library. pp. 387:3203–387:3231. doi:10.1145/3763165 . Retrieved 2 December 2025.

[1]