Forgetting in multi-agent modal logics

doi:10.1016/j.artint.2018.08.003

Forgetting in multi-agent modal logics

2019-01-01

6

OA

AI

DOI：10.1016/j.artint.2018.08.003

原文链接

查看原文

摘要

En 中文

In the past decades, forgetting has been investigated for many logics and has found many applications in knowledge representation and reasoning. In this paper, we study forgetting in multi-agent modal logics. We adopt the semantic definition of existential bisimulation quantifiers as that of forgetting. We resort to canonical formulas of modal logics introduced by Moss. An arbitrary modal formula is equivalent to the disjunction of a unique set of satisfiable canonical formulas. We show that, for the logics of K-n, D-n, T-n, K45(n), KD45(n) and S5(n), the result of forgetting an atom from a satisfiable canonical formula can be computed by simply substituting the literals of the atom with T. Thus we show that these logics are closed under forgetting, and hence have uniform interpolation. Finally, we generalize the above results to include common knowledge of propositional formulas. (C) 2018 Elsevier B.V. All rights reserved.

Keyword:

Multi-agent modal logics

Forgetting

Uniform interpolation

Forgetting in multi-agent modal logics

摘要

AI总结

期刊

机构