Uncertainty-based knowing how logic

C. Areces, R. Fervari, A. Saravia, and F. Velázquez-Quesada. Uncertainty-based knowing how logic. Journal of Logic and Computation, 33(6):1301–1325, 2025.

Download

[pdf] 

Abstract

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.

BibTeX

@Article{arec:unce23,
  author =       "C. Areces and R. Fervari and A. Saravia and F.
                 Velázquez-Quesada",
  title =        "Uncertainty-based knowing how logic",
  year =         "2025",
  abstract =     "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.",
  volume       = {33},
  number       = {6},
  pages        = {1301--1325},
  journal =      "Journal of Logic and Computation",
  issn = "0955-792X",
}