<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE root>
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:ali="http://www.niso.org/schemas/ali/1.0/" article-type="research-article" dtd-version="1.2" xml:lang="en"><front><journal-meta><journal-id journal-id-type="publisher-id">Discrete and Continuous Models and Applied Computational Science</journal-id><journal-title-group><journal-title xml:lang="en">Discrete and Continuous Models and Applied Computational Science</journal-title><trans-title-group xml:lang="ru"><trans-title>Discrete and Continuous Models and Applied Computational Science</trans-title></trans-title-group></journal-title-group><issn publication-format="print">2658-4670</issn><issn publication-format="electronic">2658-7149</issn><publisher><publisher-name xml:lang="en">Peoples' Friendship University of Russia named after Patrice Lumumba (RUDN University)</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="publisher-id">8364</article-id><article-categories><subj-group subj-group-type="toc-heading" xml:lang="en"><subject>Articles</subject></subj-group><subj-group subj-group-type="toc-heading" xml:lang="ru"><subject>Статьи</subject></subj-group><subj-group subj-group-type="article-type"><subject>Research Article</subject></subj-group></article-categories><title-group><article-title xml:lang="en">The Algorithms of the Mulri-Threaded Relevant LP-inference</article-title><trans-title-group xml:lang="ru"><trans-title>Параллельные алгоритмы релевантного LP-вывода</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author"><name-alternatives><name xml:lang="en"><surname>Bolotova</surname><given-names>S Yu</given-names></name><name xml:lang="ru"><surname>Болотова</surname><given-names>Светлана Юрьевна</given-names></name></name-alternatives><email>bolotova.svetlana@gmail.com</email><xref ref-type="aff" rid="aff1"/></contrib><contrib contrib-type="author"><name-alternatives><name xml:lang="en"><surname>Makhortov</surname><given-names>S D</given-names></name><name xml:lang="ru"><surname>Махортов</surname><given-names>Сергей Дмитриевич</given-names></name></name-alternatives><email>sd@expert.vrn.ru</email><xref ref-type="aff" rid="aff1"/></contrib></contrib-group><aff-alternatives id="aff1"><aff><institution xml:lang="en">Voronezh State University</institution></aff><aff><institution xml:lang="ru">Воронежский государственный университет</institution></aff></aff-alternatives><pub-date date-type="pub" iso-8601-date="2014-02-15" publication-format="electronic"><day>15</day><month>02</month><year>2014</year></pub-date><issue>2</issue><issue-title xml:lang="en">NO2 (2014)</issue-title><issue-title xml:lang="ru">№2 (2014)</issue-title><fpage>216</fpage><lpage>219</lpage><history><date date-type="received" iso-8601-date="2016-09-08"><day>08</day><month>09</month><year>2016</year></date></history><permissions><copyright-statement xml:lang="ru">Copyright ©; 2014, Болотова С.Ю., Махортов С.Д.</copyright-statement><copyright-year>2014</copyright-year><copyright-holder xml:lang="ru">Болотова С.Ю., Махортов С.Д.</copyright-holder><ali:free_to_read xmlns:ali="http://www.niso.org/schemas/ali/1.0/"/><license><ali:license_ref xmlns:ali="http://www.niso.org/schemas/ali/1.0/">http://creativecommons.org/licenses/by/4.0</ali:license_ref></license></permissions><self-uri xlink:href="https://journals.rudn.ru/miph/article/view/8364">https://journals.rudn.ru/miph/article/view/8364</self-uri><abstract xml:lang="en">The relevant LP-inference, which is based on the solution of logical equations, is an effective tool that can be used for research and optimization of production-logical systems. It significantly reduces the number of executed queries to an external source of information (either to a database or an interactive user). The preference is given to testing the facts that are really needed in the inference. However, experiments have shown that the process of using the relevant LP-inference may require an excessive amount of computational resources of the computer. So, the relevant LP-inference method was modified to use parallel computing algorithms. This paper describes the implementation of a multi-threaded algorithms for relevant LP-inference and provides the pseudocodes of these algorithms. Multi-threading is a fundamentally new element in the implementation, which allows speeding up the process of constructing sets of facts that are required in the inference, and their further processing.</abstract><trans-abstract xml:lang="ru">Релевантный LP-вывод, который основывается на решении логических уравнений, является эффективным средством для исследования и оптимизации продукционно-логических систем. Он позволяет существенно сократить количество выполняемых запросов к внешнему источнику информации (к базе данных или интерактивному пользователю). Предпочтение отдаётся исследованию только тех фактов, которые действительно необходимы при выводе. Однако эксперименты показали, что процесс использования релевантного LP-вывода может потребовать большого количества вычислительных ресурсов компьютера. В связи с этим метод релевантного LP-вывода был модифицирован путём использования параллельных вычислений. В этой статье описывается реализация параллельных алгоритмов релевантного LP-вывода и приводятся псевдокоды этих алгоритмов. Многопоточность является абсолютно новым элементом в реализации, который позволяет ускорить процесс построения множеств фактов, которые необходимы при выводе, и их дальнейшего исследования.</trans-abstract><kwd-group xml:lang="en"><kwd>backward inference</kwd><kwd>relevant inference</kwd><kwd>logic equations</kwd><kwd>parallelism</kwd><kwd>multi-threading</kwd></kwd-group><kwd-group xml:lang="ru"><kwd>обратный вывод</kwd><kwd>релевантный вывод</kwd><kwd>логические уравнения</kwd><kwd>многопоточность</kwd></kwd-group></article-meta></front><body></body><back><ref-list><ref id="B1"><label>1.</label><mixed-citation>Gupta A. Parallelism in Production Systems. - London: Pitman, 1987.</mixed-citation></ref><ref id="B2"><label>2.</label><mixed-citation>Liberatore P. Redundancy in Logic II: 2CNF and Horn Propositional Formulae // Artificial Intelligence. - 2008. - Vol. 172, No 2-3. - Pp. 265-299.</mixed-citation></ref><ref id="B3"><label>3.</label><mixed-citation>Maciol A. An Application of Rule-Based Tool in Attributive Logic for Business Rules Modeling // Expert Systems with Applications. - 2008. - Vol. 34, No 3. - Pp. 1825-1836.</mixed-citation></ref><ref id="B4"><label>4.</label><mixed-citation>Poli R., Langdon W. B. Backward-Chaining Evolutionary Algorithms // Artificial Intelligence. - 2006. - Vol. 170, No 11. - Pp. 953-982.</mixed-citation></ref><ref id="B5"><label>5.</label><mixed-citation>Katerinenko R. S., Bessmertnyi I. A. A Method for Acceleration of Logical Inference in the Production Knowledge Model // Programming and Computer Software. - 2009. - Vol. 37, No 4. - Pp. 197-199.</mixed-citation></ref><ref id="B6"><label>6.</label><mixed-citation>Makhortov S. D. Mathematical Foundations of Artificial Intelligence: Theory LP-structures for the Construction and Studying of Knowledge Models of Production Type / Ed. by V. A. Vasenin. - Moscow: MCCME, 2009.</mixed-citation></ref><ref id="B7"><label>7.</label><mixed-citation>Richter J. Programming applications for Microsoft Windows. - Grove City: Microsoft Press, 1999.</mixed-citation></ref></ref-list></back></article>
