Uncertainty-Based Semantics for Multi-Agent Knowing How Logics

TL;DR

This paper proposes a new semantics for multi-agent knowing-how logics based on indistinguishability of plans, aligning it more closely with standard epistemic logic, and analyzes its properties and computational aspects.

Contribution

It introduces a novel semantics for multi-agent knowing-how logics, connects it with existing approaches, and provides a complete axiomatization and complexity analysis.

Findings

New semantics captures previous approaches.

Established sound and complete axiomatization.

Analyzed model checking and satisfiability complexity.

Abstract

We introduce a new semantics for a multi-agent epistemic operator of knowing how, based on an indistinguishability relation between plans. Our proposal is, arguably, closer to the standard presentation of knowing that modalities in classical epistemic logic. We study the relationship between this semantics and previous approaches, showing that our setting is general enough to capture them. We also define a sound and complete axiomatization, and investigate the computational complexity of its model checking and satisfiability problems.