SORTING ALGORITHM METHOD DEDUCTIVE SYNTHESIS RESOLUTION WITH BUILD A TREE REFUTATION AND EVIDENCE
DOI:
https://doi.org/10.18372/2310-5461.2.5294Keywords:
deductive synthesis, sorting algorithm, a method, resolution, retraction, finishing, building treesAbstract
This article is dedicated to the deductive program synthesis with using of resolution method on an example of sorting algorithm creation. In the article there is a shown principle that allows getting assertions-answers on the basis of method refutation and leading trees construction using.References
Тыугу Э.Х. Концептуальное программирование. — М.: Наука, 1984. — 256 с.
Башмаков А.И., Башмаков И.А. Интеллектуальные информационные технологии. — М.: Изд-во МГТУ им. Н.Э. Баумана, 2005. — 304 с.
Назаретов В.М., Ким Д.П. Робототехника и гибкие автоматизированные производства. В 9 кн. Кн. 6. Техническая имитация интеллекта: учеб. пособ. для втузов. — М.: Высш. шк., 1986. — 144 с. Чень Ч. Ли Р. Математическая логика и автоматическое доказательство теорем. М.: Наука. Глав. ред. физ.-мат. лит-ры, 1983. — 360 с.
Downloads
Published
How to Cite
Issue
Section
License
The scientific journal adheres to the principles of Open Access and provides free, immediate, and permanent access to all published materials without financial, technical, or legal barriers for readers.
All articles are published in Open Access under the Creative Commons Attribution 4.0 International (CC BY 4.0) license.
Copyright
Authors who publish their works in the journal:
-
retain the copyright to their publications;
-
grant the journal the right of first publication of the article;
-
agree to the distribution of their materials under the CC BY 4.0 license;
-
have the right to reuse, archive, and distribute their works (including in institutional and subject repositories), provided that proper reference is made to the original publication in the journal.




