Тип публикации: доклад, тезисы доклада, статья из сборника материалов конференций
Конференция: International Symposium on Logical Foundations of Computer Science (LFCS); Deerfield Beach, FL; Deerfield Beach, FL
Год издания: 2016
Идентификатор DOI: 10.1007/978-3-319-27683-0_25
Ключевые слова: Temporal logic, Multi-agent's logic, Non-transitive time, Deciding algorithms, Knowledge, Admissible rules, Multi-agent’s logic, Computability and decidability, Computation theory, Multi agent systems, Problem solving, Reconfigurable hardware, Decidability problems, Intransitivity, Mathematical problems, Multi agent, Truth values, Computer circuits
Аннотация: We study intransitive temporal logic implementing multiagent's approach and formalizing knowledge and uncertainty. An innovative point here is usage of non-transitive linear time and multi-valued models - the ones using separate valuations V-j for agent's knowledge of facts and summarized (agreed) valuation together with rules for Показать полностьюcomputation truth values for compound formulas. The basic mathematical problems we study here are - decidability and decidability w.r.t. admissible rules. First, we study general case - the logic with non-uniform intransitivity and solve its decidability problem. Also we consider a modification of this logic - temporal logic with uniform non-transitivity and solve problem of recognizing admissibility in this logic.
Журнал: LOGICAL FOUNDATIONS OF COMPUTER SCIENCE (LFCS 2016)
Выпуск журнала: Vol. 9537
Номера страниц: 364-375
ISSN журнала: 03029743
Место издания: CHAM
Издатель: SPRINGER INT PUBLISHING AG