The paper discusses the general issues of automated search of artifacts in rule-based knowledge bases (KB) based on logic with vector semantics in the VTF-logic variant. Cases of falsity of antecedent of rules at all admissible values of truth of input premises, existence of terms which are not used anywhere and generation of uncertain values of truth, emergence of contradictions are considered. Automation is considered as the organization of the direct attached logical inference opening artifacts of KB. The first two cases are identified by counting the number of each rule triggering and identifying terms that are not tied to the rules. The contradiction is revealed by the verification of the truth of the conclusions-hypotheses. The presence of a conclusion with truth (1; 1) (complete contradiction) signals a contradiction at one of the stages of reasoning, which is set by the back trace of the logical chain. A necessary stage of inference is to combine the evidence using 11-composition (the second form of disjunction). The paper also presents the principle of calculating the truth of the conclusion based on the truth of the premises, the strategy of combining evidence, numerical measures that can be used in the conclusion.
629.065The example of defining a law for operation of a stacking conveyor demonstrates the possibility of a language for algorithm graphs. This language is sufficiently universal and can be used for describing a law for operation of a wide class of manipulators and other similar devices, and it is sufficiently graphic. The algorithm graphs allow accurately, with all necessary details but at the same time concisely, describing any microprogram for operating manipulators and revealing its logical imperfection with both heuristic and formal methods of the theory of graphs. The algorithm graphs obtained can be used as the basis for developing a computer program in any both high-and low-level algorithm language.Developing software for controlling loading-unloading and transport devices has always been a relatively difficult problem, particularly due to its unwieldiness. One method of solving this problem is to use graphs. The law of operation of a certain class of manipulators whose movement can be laid out with three coordinates can be relatively simply described and formalized with them.For example, let it be necessary to describe the operating program for one of the manipulators that loads the finished product in the warehouse. For concreteness, we will not examine the warehouse as a whole, but only the part or section of the warehouse where the finished articles designated for sale in the commercial network will be stored.The loading flow diagram is shown in Fig. 1. Automatic truck 1 moves to the point in space with coordinates x t and z t . On command from the position sensor, the front wall is opened and the bottom of the truck rises with rotation around point O . The product rolls down onto carrier 2 under its own weight. Stacker 3, up to now in initial up position Z n , successively moving in the direction of coordinates X and Z, goes out to a point with the coordinates of the carrier. While moving, the stacker forks are always in some initial state Y i . After the stacker stops, the forks advance in the direction of axis +Y and stop in final position Y f , so that the first product package sliding off the carrier is between them. The forks then hold the package at the ends and move to initial position Y i , i.e., the package is placed in the stacker. The presence of packages on the carrier is identified by signal Y (package), which assumes the logical value 1.In warehouse 4, each package is stored in a separate cell with four-digit binary number Θ 1 (see Fig. 1). The warehouse should be loaded in the strict sequence defined by the cell numbers. The required loading order can be ensured by four-digit meter M 1 . The reading of this meter will always correspond to the number of the first "free" cell is the warehouse. The two lower digits of the meter register (M x ) denotes coordinate X i of this cell, and the two highest (M z ) indicate coordinate Z j . When the next cell is filled, the meter contents will increase by one.Based on process expediencies, the warehouse is unloaded in the same sequence as it is lo...
Иркутский государственный университет путей сообщения, Иркутск, Россия Аннотация Рассматривается комплексная процедура верификации продукционных баз знаний с использованием логик с векторной семантикой в варианте V TF -логик при специальном представлении фактов и правил. Описанная техника позволяет решать такие задачи верификации, как выявление несвязанных фактов, выявление незавершѐнных продукций, выявление логических кругов, контроль соответствия между множеством гипотез и множеством терминальных фактов, выявление противоречий, выявление молчащих продукций, выявление нештатных обрывов цепочек вывода. Продукции в базе знаний упорядочиваются причинно-следственным образом так, что если один и тот же факт входит в правую часть одной продукция и левую часть другой, первая продукция всегда выполняется раньше. В результате процедура верификации имеет линейную сложность по числу правил и экспоненциальную по числу стартовых фактов. Объѐм вычислений можно существенно уменьшить, выделяя группы фактов, относящихся к конкретной гипотезе. Новым является применение для верификации аппарата логик с векторной семантикой, которые сохраняют способность к выводу при аномальных значениях истинности. Это позволяет, в частности, использовать машину вывода для динамической верификации знаний. В результате не требуется вводить в систему дополнительные архитектурные элементы (например, таблицы решений), создавать внешние верифицирующие программы и т.п. Получение решения обеспечивается штатными средствами экспертной системы. Статическая верификация обеспечивается специальным представлением фактов и правил.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.