We introduce a novel 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 new semantics and previous approaches, showing that our setting is general enough to capture them. We also study the logical properties of the new semantics. First, we define a sound and complete axiomatization. Second, we define a suitable notion of bisimulation and prove correspondence theorems. Finally, we investigate the computational complexity of the model checking and satisfiability problems for the new logic.

翻译：我们提出了一种基于计划之间不可区分关系的多智能体知道如何认知算子的新颖语义。可以说，我们的提议更接近经典认知逻辑中知道模态的标准呈现。我们研究了这种新语义与先前方法之间的关系，表明我们的框架具有足够的通用性来涵盖它们。我们还研究了新语义的逻辑性质。首先，我们定义了一个可靠且完全的公理化系统。其次，我们定义了合适的互模拟概念并证明了对应定理。最后，我们研究了新逻辑中模型检测和可满足性问题的计算复杂性。