BUILDING A TRAINING TECHNIQUE (BASED ON THE ALGORITHM OF VERIFICATION OF THE INCONSISTENCY OF THE SET OF DISJUNCTORS)

Stas Andrey Nikolaevich, Kartashov Denis Vasilyevich

DOI: 10.23951/1609-624X-2017-12-184-187

Information About Author:

Stas A. N., Tomsk State Pedagogical University (ul. Kievskaya, 60, Tomsk, Russian Federation, 634061). E-mail: stasandr@tspu.edu.ru Kartashov D. V., Tomsk State Pedagogical University (ul. Kievskaya, 60, Tomsk, Russian Federation, 634061). E-mail: DeKar@tspu.edu.ru

The use of knowledge-based algorithms is one of the most relevant directions. Often these algorithms are referred to as intelligent. It is accepted to distinguish four main classes of such models: logical, productional, frame-based, and network. As we know, the use of any given models is driven by the tasks in hand. From this perspective, logical models have gained momentum. In particular, these models are often used in the creation of expert systems and the automation of proofs of theorems. This article discusses how to implement the validation algorithm for multiple disjuncts. An automatic grammar is used to describe the language of presenting the disjuncts, a resolution method to check their inconsistencies, and a depthfirst search to automate the OL-denial strategy. This algorithm can be used to automatically check provability or indefeasibility of theorems based on many axioms. The step-by-step detalization of this algorithm can be used as an additional tool for teaching the resolution method and searching the state space as well as the basics of the formal languages. The type of going around state space depends on the order of the points in the list OPEN. When searching in the first point’s depth to open it you select the point that is most remote from the intentional one. In this case, you can simplify the implementation of this method by applying a recursive subprogram.

Keywords: disjunct, resolution method, OL-denial strategy, finite-state grammar, depthfirst search

References:

1. Semenov N. A. Intellektual’nyye informtsionnyye sistemy: uchebnoye posobiye [Intelligent information systems: tutorial]. Tver’: TSTU Publ., 2009. 124 p. (in Russian).

2. Izbachkov Yu. S., Petrov V. N. Informatsionnyye sistemy: uchebnik dlya vuzov. 2-e izd. [Information systems: textbook for universities. 2 edition]. Saint Petersburg, Piter Publ., 2008. 655 p. (in Russian).

3. Klishin A. P., Stas A. N., Gazizov T. T., Goryunov V. A., Kiyanitsyn A. V., Butakov A. N., Mytnik A. A. Osnovnye napravleniya informatizatsii deyatel’nosti Tomskogo gosudarstvennogo pedagogoicheskogo universiteta [Main directions for applying information technologies to the automation of TSPU activities]. Vestnik Tomskogo gosudarstvennogo pedagogicheskogo universiteta – TSPU Bulletin, 2015, vol. 3 (156), pp. 110–118 (in Russian).

4. Prosolupov E. V. Kurs lektsiy po diskretnoy matematike: uchebnoye posobiye. Ch. 2. Matematicheskaya logika [A course of lectures on discrete mathematics: tutorial. Part 2. Mathematical logic]. Saint Petersburg, SpbSU Publ., 2013. 74 p. (in Russian).

5. Igoshin V. I. Matematicheskaya logika i teoriya algoritmov: uchebnoye posobiye dlya vuzov. 3-e izd., stereotip. [Mathematical Logic and theory of Algorithms: textbook for higher schools. 3 edition, stereotype]. Moscow, Akademiya Publ., 2008. 446 p. (in Russian).

6. Vagin V. N., Fomina M. V., Golovina E. Yu., Zagoryanskaya A. A. Dostovernyy i pravdopodobnyy vyvod v intellektual’nykh sistemakh [A reliable and plausible conclusion in intelligent systems]. Moscow, Fizmatlit Publ., 2008. 712 p. (in Russian).

7. Grinchenkov D. V., Pototskiy S. I. Matematicheskaya logika i teoriya algoritmov dlya programmistov: uchebnoye posobiye dlya vuzov [Mathematical logic and algorithm theory for programmers: textbook for higher schools]. Moscow, KNORUS Publ., 2010. 206 p. (in Russian).

8. Yakimenko O. V., Stas’ A. N. Primeneniye obuchayushchikh programm-trenazherov v obuchenii programmirovaniyu [Use of computer tutors in teaching programming]. Vestnik Tomskogo gosudarstvennogo pedagogicheskogo universiteta – TSPU Bulletin, 2009, vol. 1 (79), pp. 54–56 (in Russian).

9. Stas A. N., Dolganova N. F. Razvitiye algoritmicheskogo myshleniya v protsesse obucheniya budushchikh uchiteley informatiki [Algorithmic thinking development when training computer science teachers]. Vestnik Tomskogo gosudarstvennogo pedagogicheskogo universiteta – TSPU Bulletin, 2012, vol. 7 (122), pp. 241–244 (in Russian).

10. Stas A. N., Prusskikh O. N. Formirovaniye algoritmicheskogo myshleniya v protsesse obucheniya teorii grafov [Shaping the algorithmic thinking in the process of the education graph theory]. Vestnik Tomskogo gosudarstvennogo pedagogicheskogo universiteta – TSPU Bulletin, 2012, vol. 2 (117), pp. 166–169 (in Russian).

( 417.17 kB ) ( 411.21 kB )

Issue: 12, 2017

Series of issue: Issue 12

Rubric: INTERDISCIPLINARY RESEARCH

Pages: 184 — 187

Downloads: 742