Regular constraint
In artificial intelligence and operations research, a regular constraint is a kind of global constraint. It can be used to solve a particular type of puzzle called a nonogram or logigrams.
External links
- Paltzer, Nikos. Regular Language Membership Constraint
 | This article has not been added to any content categories. Please help out by adding categories to it so that it can be listed with similar articles, in addition to a stub category. (September 2010) |
 | 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. |