activity
20172020
most citedTuring Completeness of Finite, Epistemic Programs

3 citations · 7 across the 5 of their papers we have counts for

collaborators

6 papers

math.LO2020

Probabilities with Gaps and Gluts

Dominik Klein, Ondrej Majer, Soroush Rafiee Rad

Belnap-Dunn logic (BD), sometimes also known as First Degree Entailment, is a four-valued propositional logic that complements the classical truth values of True and False with two…

cs.CV2019

The Stroke Correspondence Problem, Revisited

Dominik Klein

We revisit the stroke correspondence problem [13,14]. We optimize this algorithm by 1) evaluating suitable preprocessing (normalization) methods 2) extending the algorithm with an…

math.LO2018★ 2 cited

Pointwise intersection in neighbourhood modal logic

Frederik Van De Putte, Dominik Klein

We study the logic of neighbourhood models with pointwise intersection, as a means to characterize multi-modal logics. Pointwise intersection takes us from a set of neighbourhood s…

cs.LO2017

Convergence, Continuity and Recurrence in Dynamic Epistemic Logic

Dominik Klein, Rasmus K. Rendsvig

The paper analyzes dynamic epistemic logic from a topological perspective. The main contribution consists of a framework in which dynamic epistemic logic satisfies the requirements…

cs.FL2017★ 3 cited

Turing Completeness of Finite, Epistemic Programs

Dominik Klein, Rasmus K. Rendsvig

In this note, we show the class of finite, epistemic programs to be Turing complete. Epistemic programs is a widely used update mechanism used in epistemic logic, where it such are…

math.LO2017★ 2 cited

Metrics for Formal Structures, with an Application to Kripke Models and their Dynamics

Dominik Klein, Rasmus K. Rendsvig

This report introduces and investigates a family of metrics on sets of pointed Kripke models. The metrics are generalizations of the Hamming distance applicable to countably infini…