Towards a Formalisation of Justification and Justifiability
Open Access
- 21 October 2021
- journal article
- Published by Open Publishing Association in Electronic Proceedings in Theoretical Computer Science
- Vol. 348, 136-149
- https://doi.org/10.4204/eptcs.348.10
Abstract
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.This publication has 25 references indexed in Scilit:
- InKreSAT: Modal Reasoning via Incremental Reduction to SATLecture Notes in Computer Science, 2013
- Exact and fully symbolic verification of linear hybrid automata with large discrete state spacesScience of Computer Programming, 2012
- THE LOGIC OF JUSTIFICATIONThe Review of Symbolic Logic, 2008
- System Description: Spass Version 3.0Lecture Notes in Computer Science, 2007
- Poset extensions, convex sets, and semilattice presentationsDiscrete Mathematics, 2007
- Justified common knowledgeTheoretical Computer Science, 2006
- On unique factorization semilatticesDiscussiones Mathematicae - General Algebra and Applications, 2000
- The algorithmic analysis of hybrid systemsTheoretical Computer Science, 1995
- On the semilattice of idempotents of a free inverse monoidProceedings of the Edinburgh Mathematical Society, 1993
- Studies in the Logic of ExplanationPhilosophy of Science, 1948