<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "JATS-journalpublishing1-3.dtd">
<article article-type="research-article" dtd-version="1.3" 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" xml:lang="ru"><front><journal-meta><journal-id journal-id-type="publisher-id">mais</journal-id><journal-title-group><journal-title xml:lang="ru">Моделирование и анализ информационных систем</journal-title><trans-title-group xml:lang="en"><trans-title>Modeling and Analysis of Information Systems</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">1818-1015</issn><issn pub-type="epub">2313-5417</issn><publisher><publisher-name>Yaroslavl State University</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.18255/1818-1015-2021-1-90-103</article-id><article-id custom-type="elpub" pub-id-type="custom">mais-1474</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research Article</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="ru"><subject>Discrete Mathematics in Relation to Computer Science</subject></subj-group></article-categories><title-group><article-title>Автоматизированная обучающая система «Множества» (исследования организации 1-й части проекта)</article-title><trans-title-group xml:lang="en"><trans-title>Automated Teaching System “Sets” (Research for Organizing the 1st Part of the Project)</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0002-0252-9958</contrib-id><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Рублев</surname><given-names>Вадим Сергеевич</given-names></name><name name-style="western" xml:lang="en"><surname>Rublev</surname><given-names>Vadim S.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Кандидат физико-математических наук, профессор</p><p>ул. Советская, 14, г. Ярославль, 150003</p></bio><bio xml:lang="en"><p>PhD, Professor</p><p>14 Sovetskaya, Yaroslavl 150003</p></bio><email xlink:type="simple">roublev@mail.ru</email><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0002-7238-3675</contrib-id><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Кондаков</surname><given-names>Максим Дмитриевич</given-names></name><name name-style="western" xml:lang="en"><surname>Kondakov</surname><given-names>Maxim D.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Студент кафедры теоретической информатики</p><p>ул. Советская, 14, г. Ярославль, 150003</p></bio><bio xml:lang="en"><p>Student of the Department of Theoretical Informatics</p><p>14 Sovetskaya, Yaroslavl 150003</p></bio><email xlink:type="simple">kondakovmd99@mail.ru</email><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru"><institution>Ярославский государственный университет им. П. Г. Демидова</institution><country>Россия</country></aff><aff xml:lang="en"><institution>P. G. Demidov Yaroslavl State University</institution><country>Russian Federation</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2021</year></pub-date><pub-date pub-type="epub"><day>23</day><month>03</month><year>2021</year></pub-date><volume>28</volume><issue>1</issue><fpage>90</fpage><lpage>103</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Рублев В.С., Кондаков М.Д., 2021</copyright-statement><copyright-year>2021</copyright-year><copyright-holder xml:lang="ru">Рублев В.С., Кондаков М.Д.</copyright-holder><copyright-holder xml:lang="en">Rublev V.S., Kondakov M.D.</copyright-holder><license xml:lang="ru" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>Данная работа распространяется под лицензией Creative Commons Attribution 4.0.</license-p></license><license xml:lang="en" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>This work is licensed under a Creative Commons Attribution 4.0 License.</license-p></license></permissions><self-uri xlink:href="https://www.mais-journal.ru/jour/article/view/1474">https://www.mais-journal.ru/jour/article/view/1474</self-uri><abstract><p>Исследуются вопросы построения автоматизированной обучающей системы «Множества», которая позволит учащемуся освоить одну из важных тем дисциплины «Дискретная математика» и развить логико-математическое мышление в этом направлении. Соответствующая тема 1-й части проекта включает материал, связанный с понятием множества, операциями над множествами, алгеброй множеств, доказательствами утверждений для множеств, выводом формул для количества элементов множества. В основе системы лежит построение с целью использования для обучения редактора доказательства утверждений для множества и редактора вывода формул для количества элементов множества. Первый из них позволяет студенту разбить исходное утверждение на ряд более простых утверждений, в совокупности эквивалентных исходному утверждению, выбрать метод доказательства каждого простого утверждения и провести их пошаговое доказательство. Второй редактор позволяет, используя формулу включения и исключения и формулу количества элементов дополнения, вывести пошагово формулу для количества элементов множества через заданные количества элементов, связанных с ним множеств. Важной частью системы является контроль правильности всех действий студента, и на этой основе разработана вся система обучения. Логический контроль правильности выбранного действия в первом редакторе осуществляется созданием системой булевой функции, соответствующей этому действию, и проверкой ее на тождественную истинность. Во втором редакторе для контроля используются такие инварианты, как характеристическая строка множества и характеристическая строка количества элементов множества. Остальная часть системы связана с обучением алгебре множеств и подготовке к использованию редакторов. При этом основное внимание уделяется стратегии обучения, при которой проверка понимания усвоенного материала является довольно строгой, исключающей случайный выбор ответов. Разбиение материала на секции с контролем успешности обучения не только тестами, но и упражнениями и задачами, позволяет студенту овладеть сложным логико-математическим аппаратом доказательства утверждений для множеств и вывода формулы для количества элементов множества.</p></abstract><trans-abstract xml:lang="en"><p>The issues of building an automated learning system “Sets” which will allow students to master one of the important topics of the discipline “Discrete Mathematics” and to develop logical and mathematical thinking in this direction are studied. The corresponding topic of the 1st part of the project includes materials related to the concept of a set, operations on sets, algebra of sets, proofs of statements for sets, and the derivation of formulas for the number of set elements. The system is based on a construction of the statements proof editor for a set and of the formulas derivation editor for the number of set elements, both editors are to be used for teaching. The first of these allows students to split the original statement into a number of simpler statements, taken together equivalent to the original statement, to choose a method of proving each simple statement and to conduct their step-by-step proof. The second editor allows (using the inclusion-exclusion principle and the formula of the number of complement elements) to derive a step-by-step formula for the number of set elements through the specified numbers of elements for sets from which the resulting set is constructed. An important part of the system is to monitor the correctness of all actions of students, and on this basis the entire learning system is developed. The logical supervision over the correctness of the selected action in the first editor is performed by a Boolean function created by the system and corresponding to this action and by checking it for identical truth. In the second editor, invariants such as characteristic strings of the set and of its number of elements are used for verification. The rest of the system is related to learning of set algebra and to preparation to editors usage. The main focus here is on the learning strategy in which testing the understanding of the learned material is rather rigorous and eliminating the random choice of answers. The division of the material into sections with verification of the success of teaching not only by tests, but also by exercises and tasks, allows students to master the complex logical and mathematical techniques of proving statements for sets and derivation of formulas for the number of set elements.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>компьютерное обучение</kwd><kwd>дискретные множества</kwd><kwd>алгебра множеств</kwd><kwd>утверждения для множеств</kwd><kwd>пошаговое доказательство</kwd><kwd>количество элементов множества</kwd><kwd>вывод формулы</kwd><kwd>контроль корректности</kwd></kwd-group><kwd-group xml:lang="en"><kwd>computer learning</kwd><kwd>discrete sets</kwd><kwd>set algebra</kwd><kwd>statements for sets</kwd><kwd>step-by-step proof</kwd><kwd>number of set elements</kwd><kwd>formula derivation</kwd><kwd>correctness control</kwd></kwd-group><funding-group><funding-statement xml:lang="ru">Работа выполнена в рамках инициативной НИР ЯрГУ им. П. Г. Демидова № VIP-016</funding-statement><funding-statement xml:lang="en">This work was supported by P. G. Demidov Yaroslavl State University Project № VIP-016</funding-statement></funding-group></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">A. Buchner, Moodle 3 Administration. Third Edition. Packt Publishing, 2016.</mixed-citation><mixed-citation xml:lang="en">A. Buchner, Moodle 3 Administration. Third Edition. Packt Publishing, 2016.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">S. K. Udaya and T. V. Vamsi Krishna, “E-Learning: Technological Development in Teaching for school kids”, International Journal of Computer Science and Information Technologies, vol. 5, no. 5, pp. 6124–6126, 2014.</mixed-citation><mixed-citation xml:lang="en">S. K. Udaya and T. V. Vamsi Krishna, “E-Learning: Technological Development in Teaching for school kids”, International Journal of Computer Science and Information Technologies, vol. 5, no. 5, pp. 6124–6126, 2014.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">M. Kerres, D. Meister, F. von Gross, and U. Sander, Enzyklopadie Erziehungswissenschaft. 2012.</mixed-citation><mixed-citation xml:lang="en">M. Kerres, D. Meister, F. von Gross, and U. Sander, Enzyklopadie Erziehungswissenschaft. 2012.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">S. Clark and J. Baggaley, “Assistive Software for Disabled Learners”, The International Review of Research in Open and Distributed Learning, vol. 5, no. 3, 2004. [Online]. Available: https://doi.org/10.19173/irrodl.v5i3.198.</mixed-citation><mixed-citation xml:lang="en">S. Clark and J. Baggaley, “Assistive Software for Disabled Learners”, The International Review of Research in Open and Distributed Learning, vol. 5, no. 3, 2004. [Online]. Available: https://doi.org/10.19173/irrodl.v5i3.198.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">A. Nagy, “The Impact of E-Learning”, in E-Content: Technologies and Perspectives for the European Market, Berlin: Springer-Verlag, 2005, pp. 79–96. [Online]. Available: https://doi.org/10.1007/3-540-26387-X_4.</mixed-citation><mixed-citation xml:lang="en">A. Nagy, “The Impact of E-Learning”, in E-Content: Technologies and Perspectives for the European Market, Berlin: Springer-Verlag, 2005, pp. 79–96. [Online]. Available: https://doi.org/10.1007/3-540-26387-X_4.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">I. E. Allen and J. Seaman, Changing Course: Ten Years of Tracking Online Education in the United States. Babson Survey Research Group, 2013.</mixed-citation><mixed-citation xml:lang="en">I. E. Allen and J. Seaman, Changing Course: Ten Years of Tracking Online Education in the United States. Babson Survey Research Group, 2013.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">D. Burgos et al., Eds., Higher Education Learning Methodologies and Technologies Online, Springer, 2019, pp. 6–7.</mixed-citation><mixed-citation xml:lang="en">D. Burgos et al., Eds., Higher Education Learning Methodologies and Technologies Online, Springer, 2019, pp. 6–7.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">A. Holzinger et al., Eds., Machine Learning and Knowledge Extraction. Springer, 2019.</mixed-citation><mixed-citation xml:lang="en">A. Holzinger et al., Eds., Machine Learning and Knowledge Extraction. Springer, 2019.</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Y. Zhang and D. Cristol, Handbook of Mobile Teaching and Learning. Springer, 2019.</mixed-citation><mixed-citation xml:lang="en">Y. Zhang and D. Cristol, Handbook of Mobile Teaching and Learning. Springer, 2019.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">S. Kong and H. Abelson, Computational Œinking Education. Springer Nature, 2019.</mixed-citation><mixed-citation xml:lang="en">S. Kong and H. Abelson, Computational Œinking Education. Springer Nature, 2019.</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">G. Hanna, D. Reid, and M. de Villiers, Proof Technology in Mathematics Research and Teaching. Springer, 2019.</mixed-citation><mixed-citation xml:lang="en">G. Hanna, D. Reid, and M. de Villiers, Proof Technology in Mathematics Research and Teaching. Springer, 2019.</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">M. England and other, Eds., Computer Algebra in Scientific Computing, Springer, 2019.</mixed-citation><mixed-citation xml:lang="en">M. England and other, Eds., Computer Algebra in Scientific Computing, Springer, 2019.</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">J. H. Davenport, Y. Siret, and E. Tournier, Computer algebra: systems and algorithms for algebraic computation. Academic Press, 1988.</mixed-citation><mixed-citation xml:lang="en">J. H. Davenport, Y. Siret, and E. Tournier, Computer algebra: systems and algorithms for algebraic computation. Academic Press, 1988.</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">J. Gathen and J. Gerhard, Modern Computer Algebra. Cambridge University Press, 2013.</mixed-citation><mixed-citation xml:lang="en">J. Gathen and J. Gerhard, Modern Computer Algebra. Cambridge University Press, 2013.</mixed-citation></citation-alternatives></ref><ref id="cit15"><label>15</label><citation-alternatives><mixed-citation xml:lang="ru">V. B. Taranchuk, The main functions of computer algebra systems, in Russian. Minsk: BSU, 2013.</mixed-citation><mixed-citation xml:lang="en">V. B. Taranchuk, The main functions of computer algebra systems, in Russian. Minsk: BSU, 2013.</mixed-citation></citation-alternatives></ref><ref id="cit16"><label>16</label><citation-alternatives><mixed-citation xml:lang="ru">A. V. Ermilova and V. S. Rublev, “Problems of mathematical thinking development for students basing on example of teaching system to the course “Algorithms and computational complexity analysis””, in Russian, in Proceedings of IX International theoretical and practical conference Information Technologies and IT-Education, Moscow: INTUIT.RU, 2014, pp. 297–304.</mixed-citation><mixed-citation xml:lang="en">A. V. Ermilova and V. S. Rublev, “Problems of mathematical thinking development for students basing on example of teaching system to the course “Algorithms and computational complexity analysis””, in Russian, in Proceedings of IX International theoretical and practical conference Information Technologies and IT-Education, Moscow: INTUIT.RU, 2014, pp. 297–304.</mixed-citation></citation-alternatives></ref><ref id="cit17"><label>17</label><citation-alternatives><mixed-citation xml:lang="ru">V. S. Rublev and M. T. Yusufov, “Automated system for teaching computational complexity analysis of algorithms”, in Russian, Modern Information Technologies and IT-Education, vol. 12, no. 1, pp. 135–145, 2016.</mixed-citation><mixed-citation xml:lang="en">V. S. Rublev and M. T. Yusufov, “Automated system for teaching computational complexity analysis of algorithms”, in Russian, Modern Information Technologies and IT-Education, vol. 12, no. 1, pp. 135–145, 2016.</mixed-citation></citation-alternatives></ref><ref id="cit18"><label>18</label><citation-alternatives><mixed-citation xml:lang="ru">V. S. Rublev and M. T. Yusufov, “Automated teaching system “Analysis of algorithms computational complexity” (research for organizing the 1st part of the project)”, in Russian, Modern Information Technologies and IT-Education, vol. 13, no. 2, pp. 170–178, 2017.</mixed-citation><mixed-citation xml:lang="en">V. S. Rublev and M. T. Yusufov, “Automated teaching system “Analysis of algorithms computational complexity” (research for organizing the 1st part of the project)”, in Russian, Modern Information Technologies and IT-Education, vol. 13, no. 2, pp. 170–178, 2017.</mixed-citation></citation-alternatives></ref><ref id="cit19"><label>19</label><citation-alternatives><mixed-citation xml:lang="ru">V. S. Rublev and M. T. Yusufov, “Automated System for Teaching Computational Complexity of Algorithms Course”, in Russian, Modeling and Analysis of Information Systems, vol. 24, no. 4, pp. 481–495, 2017.</mixed-citation><mixed-citation xml:lang="en">V. S. Rublev and M. T. Yusufov, “Automated System for Teaching Computational Complexity of Algorithms Course”, in Russian, Modeling and Analysis of Information Systems, vol. 24, no. 4, pp. 481–495, 2017.</mixed-citation></citation-alternatives></ref><ref id="cit20"><label>20</label><citation-alternatives><mixed-citation xml:lang="ru">V. S. Rublev and M. T. Yusufov, “Models for teaching analysis of algorithm computational complexity”, in Russian, in 3rd International on Computer Algebra and Information Technologies, Odessa: ONSU, 2018, pp. 157–160.</mixed-citation><mixed-citation xml:lang="en">V. S. Rublev and M. T. Yusufov, “Models for teaching analysis of algorithm computational complexity”, in Russian, in 3rd International on Computer Algebra and Information Technologies, Odessa: ONSU, 2018, pp. 157–160.</mixed-citation></citation-alternatives></ref><ref id="cit21"><label>21</label><citation-alternatives><mixed-citation xml:lang="ru">V. S. Rublev and D. R. Vakhmyanin, “Automated system for teaching «Proof of statements for sets»”, in Russian, Modern Information Technologies and IT-Education, vol. 15, no. 4, pp. 1014–1027, 2019.</mixed-citation><mixed-citation xml:lang="en">V. S. Rublev and D. R. Vakhmyanin, “Automated system for teaching «Proof of statements for sets»”, in Russian, Modern Information Technologies and IT-Education, vol. 15, no. 4, pp. 1014–1027, 2019.</mixed-citation></citation-alternatives></ref><ref id="cit22"><label>22</label><citation-alternatives><mixed-citation xml:lang="ru">V. S. Rublev, Boolean functions (individual work #4 and #5 for the course “Discrete Mathematics”), in Russian. Yaroslavl: YSU, 2018.</mixed-citation><mixed-citation xml:lang="en">V. S. Rublev, Boolean functions (individual work #4 and #5 for the course “Discrete Mathematics”), in Russian. Yaroslavl: YSU, 2018.</mixed-citation></citation-alternatives></ref><ref id="cit23"><label>23</label><citation-alternatives><mixed-citation xml:lang="ru">V. S. Rublev, Sets (individual work #1 for the course “Discrete Mathematics”), in Russian. Yaroslavl: YSU, 2018.</mixed-citation><mixed-citation xml:lang="en">V. S. Rublev, Sets (individual work #1 for the course “Discrete Mathematics”), in Russian. Yaroslavl: YSU, 2018.</mixed-citation></citation-alternatives></ref></ref-list><fn-group><fn fn-type="conflict"><p>The authors declare that there are no conflicts of interest present.</p></fn></fn-group></back></article>
