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 |
id |
doaj-a47cdea37a5b4a9bb72fc46d794b6049 |
---|---|
record_format |
Article |
spelling |
doaj-a47cdea37a5b4a9bb72fc46d794b60492020-11-25T00:49:14Zeng Ivannikov Institute for System Programming of the Russian Academy of SciencesТруды Института системного программирования РАН2079-81562220-64262018-10-011901069Theoretical and practical complexity estimates for local propagation methods in constraint-based programming applicationsV. A. Semenov0O. V. Sidyaka1ИСП РАНИСП РАН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 polynomial time. The results of computational experiments are presented to illustrate the method advantages over traditional algorithms.https://ispranproceedings.elpub.ru/jour/article/view/1069<i>методы локального распространения значений и степеней свободы</i><i>программирование в ограничениях</i><i>оценки сложности</i> |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
V. A. Semenov O. V. Sidyaka |
spellingShingle |
V. A. Semenov O. V. Sidyaka Theoretical and practical complexity estimates for local propagation methods in constraint-based programming applications Труды Института системного программирования РАН <i>методы локального распространения значений и степеней свободы</i> <i>программирование в ограничениях</i> <i>оценки сложности</i> |
author_facet |
V. A. Semenov O. V. Sidyaka |
author_sort |
V. A. Semenov |
title |
Theoretical and practical complexity estimates for local propagation methods in constraint-based programming applications |
title_short |
Theoretical and practical complexity estimates for local propagation methods in constraint-based programming applications |
title_full |
Theoretical and practical complexity estimates for local propagation methods in constraint-based programming applications |
title_fullStr |
Theoretical and practical complexity estimates for local propagation methods in constraint-based programming applications |
title_full_unstemmed |
Theoretical and practical complexity estimates for local propagation methods in constraint-based programming applications |
title_sort |
theoretical and practical complexity estimates for local propagation methods in constraint-based programming applications |
publisher |
Ivannikov Institute for System Programming of the Russian Academy of Sciences |
series |
Труды Института системного программирования РАН |
issn |
2079-8156 2220-6426 |
publishDate |
2018-10-01 |
description |
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 polynomial time. The results of computational experiments are presented to illustrate the method advantages over traditional algorithms. |
topic |
<i>методы локального распространения значений и степеней свободы</i> <i>программирование в ограничениях</i> <i>оценки сложности</i> |
url |
https://ispranproceedings.elpub.ru/jour/article/view/1069 |
work_keys_str_mv |
AT vasemenov theoreticalandpracticalcomplexityestimatesforlocalpropagationmethodsinconstraintbasedprogrammingapplications AT ovsidyaka theoreticalandpracticalcomplexityestimatesforlocalpropagationmethodsinconstraintbasedprogrammingapplications |
_version_ |
1725252232943763456 |