Investigating Finite Models of Non-classical Logics with Relation Algebra and RelView

摘要

In computer science, scenarios with interacting agents are often developed using modal logic. We show how to interpret modal logic of knowledge in relation algebra. This allows the use of the RelView tool for the purpose of investigating finite models and for visualizing certain properties. Our approach is illustrated with the well-known 'muddy children' puzzle using modal logic of knowledge. We also sketch how to treat other non-classical logics in this way. In particular, we explore our approach for computational tree logic and illustrate it with the 'mutual exclusion' example.