Theoretical and practical complexity estimates for local propagation methods in constraint-based programming applications
The issues of efficiency and robustness of local propagation methods in conformity to constraint-based programming applications are discussed. Comparative analysis of known algorithms is given and new combined method is proposed. The method allows solving of wider classes of constraint problems for...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Ivannikov Institute for System Programming of the Russian Academy of Sciences
2018-10-01
|
| Series: | Труды Института системного программирования РАН |
| Subjects: | |
| Online Access: | https://ispranproceedings.elpub.ru/jour/article/view/1069 |