Тип публикации: статья из журнала
Год издания: 2018
Идентификатор DOI: 10.17377/semi.2018.15.070
Ключевые слова: many-valued logic, multi-agent logic, multi-modal logic, computability, satisfiability, decidability, deciding algorithms
Аннотация: This paper investigates many-valuated multi-modal logics. The suggested semantics consists of relational Kripke-Hintikka models which have various accessibility relations and distinct valuations for propositional statements (letters). So we study a multi-agent approach when each agent has its own accessibility relation and also its own valuation for propositional letters. We suggest the rules for computation of truth values of formulas, illustrate our approach, and study the satisfiability problem. Using a modification of the filtration technique, we obtain a solution for satisfiability problem in basic but most important wide classes of multi-valued multi-modal models. We comment on possible applications and describe open problems.
Издание
Журнал: SIBERIAN ELECTRONIC MATHEMATICAL REPORTS-SIBIRSKIE ELEKTRONNYE MATEMATICHESKIE IZVESTIYA
Выпуск журнала: Vol. 15
Номера страниц: 829-838
ISSN журнала: 18133304
Место издания: NOVOSIBIRSK
Издатель: SOBOLEV INST MATHEMATICS
Персоны
- Moor Michael Alexandrovich (Siberian Fed Univ, Inst Math & Fundamental Informat, 79 Svobodny Pr, Krasnoyarsk 660041, Russia)
- Rybakov Vladimir Vladimirovich (Siberian Fed Univ, Inst Math & Fundamental Informat, 79 Svobodny Pr, Krasnoyarsk 660041, Russia; AP Ershov Inst Informat Syst SB RAS, Acad Lavrentjev Pr 6, Novosibirsk 630090, Russia)
Вхождение в базы данных
Информация о публикациях загружается с сайта службы поддержки публикационной активности СФУ. Сообщите, если заметили неточности.