Investigating finite models of non-classical logics with relation Algebra and REL VIEW

R. Berghammer, R.A. Schmidt

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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.
Original languageEnglish
Title of host publicationTheory and Applications of Relational Structures as Knowledge Instruments II
Subtitle of host publicationInternational Workshops of COST Action 274, TARSKI, 2002-2005, Selected Revised Papers
EditorsHarrie Swart, Ewa Orłowska, Gunther Schmidt, Marc Roubens
Place of PublicationBerlin
PublisherSpringer Berlin
Chapter2
Pages31-49
Number of pages19
ISBN (Print)9783540692232
DOIs
Publication statusPublished - 2006

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
Volume4342
ISSN (Print)0302-9743

Keywords

  • modal logic
  • transitive closure
  • critical section
  • accessibility relation
  • mutual exclusion

Fingerprint

Dive into the research topics of 'Investigating finite models of non-classical logics with relation Algebra and REL VIEW'. Together they form a unique fingerprint.

Cite this