Table interpretation of the temporal description logic LTLALC

• Дата: 2022
• Автори: Reznichenko, V.A., Chystiakova, I.S.
• Формат: Стаття
• Мова: English
• Опубліковано: Інститут програмних систем НАН України 2022
• Назва видання: Проблеми програмування
• Теми: Моделі і засоби систем баз даних та знань
• Онлайн доступ: http://dspace.nbuv.gov.ua/handle/123456789/188645
• Назва журналу: Digital Library of Periodicals of National Academy of Sciences of Ukraine
• Цитувати: Table interpretation of the temporal description logic LTLALC / V.A. Reznichenko, I.S. Chystiakova // Проблеми програмування. — 2022. — № 3-4. — С. 216-230. — Бібліогр.: 10 назв. — англ.

Description logics are widely used to describe and represent knowledge in the Semantic Web. This is a modern and powerful mechanism that provides the possibility of extracting knowledge from already existing ones. Thanks to this, conceptual of subject areas modeling has become one of the fields of application of descriptive logics, taking into account the use of inference mechanisms. Conceptual modeling is used to create databases and knowledge bases. A key issue of the subject area modeling is the ability to monitor the dynamics of changes in the state of the subject area over time. It is necessary to describe not only the current actual state of the database (knowledge bases), but also the background. Temporal descriptive logics are used to solve this problem. They have the same set of algorithmic problems that are presented in conventional descriptive logics, but to them are added questions related to the description of knowledge in time. This refers to the form of time (continuous or discrete), time structure (moments of time, intervals, chains of intervals), time linearity (linear or branched), domain (present, past, future), the concept of “now”, the method of measurement, etc. An urgent task today is to create an algorithm for the temporal interpretation of conventional descriptive logics. That is, to show a way in which temporal descriptive logic can be applied to ordinary descriptive logic. The paper presents an algorithm for temporal interpretation of LTL into ALC. Linear, unbranched time is chosen for the description goal. It is presented in the form of a whole temporal axis with a given linear order on it. Only the future tense is considered. The algorithm contains graphic notations of LTL application in ALC: concepts, concept constructors, roles, role constructors, TBox and ABox. Numerous examples are used to illustrate the application of the algorithm.