Filtrační algoritmy pro tabulární podmínky
The thesis studies an implementation of arc-consistency filtering algorithms for constraints defined in extension. We propose a new concept of binarization for decomposing high-arity ad-hoc constraints into networks of binary constraints. A theory proving correctness of the binarization is developed...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Dissertation |
| Language: | English |
| Published: |
2010
|
| Online Access: | http://www.nusl.cz/ntk/nusl-298398 |