Towards a Formalisation of Justification and Justifiability

10/25/2021
by   Willem Hagemann, et al.
0

We introduce the logic QKSD which is a normal multi-modal logic over finitely many modalities that additionally supports bounded quantification of modalities. An important feature of this logic is that it allows to quantify over the information components of systems and, hence, can be used to derive justifications. We compare the proposed logic with Artemov's justification logic and also report on a prototypical implementation of a satisfiability solver of this logic and show some examples.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/30/2019

Graded modal logic and counting bisimulation

This note sketches the extension of the basic characterisation theorems ...
research
10/07/2018

A Minesweeper Solver Using Logic Inference, CSP and Sampling

Minesweeper as a puzzle video game and is proved that it is an NPC probl...
research
01/26/2021

Behavioral Mereology: A Modal Logic for Passing Constraints

Mereology is the study of parts and the relationships that hold between ...
research
08/18/2014

Brain: Biological noise-based logic

Neural spikes in the brain form stochastic sequences, i.e., belong to th...
research
03/20/2013

A Reason Maintenace System Dealing with Vague Data

A reason maintenance system which extends an ATMS through Mukaidono's fu...
research
04/22/2023

The Logic of Prefixes and Suffixes is Elementary under Homogeneity

In this paper, we study the finite satisfiability problem for the logic ...
research
02/03/2018

Arrow Update Synthesis

In this contribution we present arbitrary arrow update model logic (AAUM...

Please sign up or login with your details

Forgot password? Click here to reset