<?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="other" 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">8591</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></subject></subj-group></article-categories><title-group><article-title xml:lang="en">Automatic Generation of Logical Knowledge</article-title><trans-title-group xml:lang="ru"><trans-title>Автоматическая генерация логического знания</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author"><name-alternatives><name xml:lang="en"><surname>Rautiainen</surname><given-names>A</given-names></name><name xml:lang="ru"><surname>Раутиайнен</surname><given-names>А</given-names></name></name-alternatives><bio xml:lang="en">Кафедра информационных технологий; Российский университет дружбы народов; Peoples' Friendship University of Russia</bio><bio xml:lang="ru">Кафедра информационных технологий; Российский университет дружбы народов</bio><email>-</email><xref ref-type="aff" rid="aff1"/></contrib></contrib-group><aff-alternatives id="aff1"><aff><institution xml:lang="en">Peoples' Friendship University of Russia</institution></aff><aff><institution xml:lang="ru">Российский университет дружбы народов</institution></aff></aff-alternatives><pub-date date-type="pub" iso-8601-date="2008-04-15" publication-format="electronic"><day>15</day><month>04</month><year>2008</year></pub-date><issue>4</issue><issue-title xml:lang="en">NO4 (2008)</issue-title><issue-title xml:lang="ru">№4 (2008)</issue-title><fpage>50</fpage><lpage>60</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 ©; 2008, Раутиайнен А.</copyright-statement><copyright-year>2008</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/8591">https://journals.rudn.ru/miph/article/view/8591</self-uri><abstract xml:lang="en">We study problems which arise deriving generating automatically logical knowledge in systems of artificial intellect, first of all in systems of automatic theorem proving. Three necessary conditions for a generator of logical knowledge are proposed and a verification of these ones is presented.
            </abstract><trans-abstract xml:lang="ru">В статье рассмотрены вопросы, которые возникают при попытке генерации автоматическим образом логического знания в системах искусственного интеллекта, в первую очередь, в системах машинного доказательства теорем. Сформулированы три необходимых требования к подобному генератору и рассмотрено, как их можно выполнить.
            </trans-abstract><kwd-group xml:lang="ru"><kwd>автоматическое доказательство теорем</kwd><kwd>искусственный интеллект</kwd></kwd-group></article-meta></front><body></body><back><ref-list><ref id="B1"><label>1.</label><mixed-citation>Solving Checkers / J. Schaeffer, Y. Bjornsson, N. Burch et al // International Joint Conference on Artificial Intelligence (IJCAI). - 2005. - Pp. 292-297.</mixed-citation></ref><ref id="B2"><label>2.</label><mixed-citation>Bouzy B., Cazenave T. Computer Go: An AI Oriented Survey // Artificial Intelligence. - Vol. 132, No 1. - 2001.</mixed-citation></ref><ref id="B3"><label>3.</label><mixed-citation>Korf R. Finding Optimal Solutions to Rubik's Cube Using Pattern Databases // Proceedings of the Fourteenth National Conference on Artificial Intelligence (AAAI-97). - Providence, RI: July 2005.</mixed-citation></ref><ref id="B4"><label>4.</label><mixed-citation>Eich H. P., Ohmann C., Lang K. Decision Support in Acute Abdominal Pain Using an Expert System Fordifferent Knowledge Bases // Tenth IEEE Symposium on Computer-Based Medical Systems, 1997. Proceedings. - 11-13 June 1997.</mixed-citation></ref><ref id="B5"><label>5.</label><mixed-citation>Toward Automating Airspace Management / G. Taylor, B. Stensrud, S. Eitelman et al // Computational Intelligence for Security and Defense Applications (CISDA). - Honolulu, HI: IEEE Press, 2007.</mixed-citation></ref><ref id="B6"><label>6.</label><mixed-citation>Validation of an Automated System Model Generator / A. J. Gonzalez, H. R. Myler, F. D. McKenzie et al // IEEE Transactions on Knowledge and Data Engineering. - Vol. 6, No 4. - August 1994.</mixed-citation></ref><ref id="B7"><label>7.</label><mixed-citation>Стефанюк В. Л. Локальная организация систем - модели и приложения. - M.: Мир, 2004.</mixed-citation></ref><ref id="B8"><label>8.</label><mixed-citation>Barstow D. R. A Knowledge-Based System for Automatic Program Construction // IJCAI. - 1977. - Pp. 382-388.</mixed-citation></ref><ref id="B9"><label>9.</label><mixed-citation>Pastre D. A Humanlike Approach for Automatic Theorem Proving // AISB/GI (ECAI). - 1978. - Pp. 248-252.</mixed-citation></ref><ref id="B10"><label>10.</label><mixed-citation>Pastre D. Knowledge-Based Theorem Proving // GI Jahrestagung. - 1980. - P. 429.</mixed-citation></ref><ref id="B11"><label>11.</label><mixed-citation>Cohen D. N. Knowledge Based Theorem Proving and Learning. - Ann Arbor: UMI, 1981.</mixed-citation></ref><ref id="B12"><label>12.</label><mixed-citation>Denzinger J., Schulz S. Recording and Analyzing Knowledge-Based Distributed Deduction Processes // Journal of Symbolic Computation. - Vol. 21. - 1996. -Pp. 523-541.</mixed-citation></ref><ref id="B13"><label>13.</label><mixed-citation>Denzinger J., Kronenburg M., Schulz S. DISCOUNT. A Distributed and Learning Equational Prover // Journal of Automated Reasoning. - Vol. 18, No 2. - August 1994. - Pp. 189-198.</mixed-citation></ref><ref id="B14"><label>14.</label><mixed-citation>Lee S. J. An Autonomous Multistrategy Theorem Proving System Using Knowledge-Based Techniques // Journal of Intelligent Information Systems. - Vol. 3, No 1. - August 1994.</mixed-citation></ref><ref id="B15"><label>15.</label><mixed-citation>Gordon M. From LCF to HOL: a Short History. - Cambridge University, 1996.</mixed-citation></ref><ref id="B16"><label>16.</label><mixed-citation>Wentzel M. M. Isabelle/Isar - a Versatile Environment for Human-Readable Formal Proof Documents. - Munchen: Institut for Informatik der Technischen, Universitet Munchen, 2001.</mixed-citation></ref><ref id="B17"><label>17.</label><mixed-citation>Pastre D. Muscadet2.3 : A Knowledge-based Theorem Prover based on Natural Deduction // International Joint Conference on Automated Reasoning IJCAR (Conference on Automated Deduction CADE-JC). - 2001. - Pp. 685-689.</mixed-citation></ref><ref id="B18"><label>18.</label><mixed-citation>Pagnol J.-P. Modelisation and Automation of Reasoning in Geometry. The ARGOS System: a Learning Companion for High-School Pupils // Proceedings of the 6th International Conference, ITS 2002. - Springer Verlag, 2002.</mixed-citation></ref><ref id="B19"><label>19.</label><mixed-citation>Раутиаинен А. Алгоритм нумерации объединения конечных множеств без пересечении // XLII Всероссийская конференция по проблемам математики, информатики, физики и химии 17-21 апреля 2006 года: Труды конференции. Секция «Программные исследования». - М.: РУДН, 2006. - С. 122-130.</mixed-citation></ref><ref id="B20"><label>20.</label><mixed-citation>Paulson L. C. The Isabelle Reference Manual. - Cambridge, United Kingdom:Computer Laboratory, University of Cambridge, 2003.</mixed-citation></ref></ref-list></back></article>
