Regular constraint
From Wikipedia, the free encyclopedia
Page Module:Message box/ambox.css has no content.
 | This article relies largely or entirely on a single source. (December 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 logigramsTemplate:Typo help inline.
References
Page Template:Reflist/styles.css has no content.
- ^ Page Module:Citation/CS1/styles.css has no content.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.
