Non-unifiability in linear temporal logic of knowledge with multi-agent relations
View/ Open:
URI (for links/citations):
https://elib.sfu-kras.ru/handle/2311/27956Author:
Башмаков, С. И.
Кошелева, А. В.
Рыбаков, В.
Corporate Contributor:
Институт математики и фундаментальной информатики
Институт космических и информационных технологий
Кафедра алгебры и математической логики
Кафедра прикладной математики и компьютерной безопасности
Date:
2016-08Journal Name:
Siberian Electronic Mathematical ReportsJournal Quartile in Scopus:
Q3Bibliographic Citation:
Башмаков, С. И. Non-unifiability in linear temporal logic of knowledge with multi-agent relations [Текст] / С. И. Башмаков, А. В. Кошелева, В. Рыбаков // Siberian Electronic Mathematical Reports. — 2016. — Т. 13. — С. 656-663Abstract:
The paper is devoted to the study of the unification problem in the linear temporal logic of knowledge with multi-agent relations (denoted in the sequel as LFPK). This logic is based on frames (models) with time points represented by integer numbers from Z and the information clusters Ci for i in Z with multi-agent accessibility relations Ri. The first main result is a theorem describing a criterion for formulas to be not unifiable in LFPK. The second one is a construction of a basis for all inference rules passive in LFPK.