Uncertainty-Based Semantics for Multi-Agent Knowing How Logics

C. Areces, R. Fervari, A. Saravia, and F. Velázquez-Quesada. Uncertainty-Based Semantics for Multi-Agent Knowing How Logics. Electronic Proceedings in Theoretical Computer Science, 335:23–37, 2021. Proceedings of the 18th Conference on Theoretical Aspects of Rationality and Knowledge, TARK 2021, Beijing, China, June 25-27, 2021

Download

[pdf] 

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.

BibTeX

@Article{abs-2106-11492,
  ISSN =         "2075-2180",
  author =       "C. Areces and R. Fervari and A. Saravia and F.
                 Vel{\'a}zquez{-}Quesada",
  note =         "Proceedings of the 18th Conference on Theoretical
                 Aspects of Rationality and Knowledge, {TARK} 2021,
                 Beijing, China, June 25-27, 2021",
  title =        "Uncertainty-Based Semantics for Multi-Agent Knowing
                 How Logics",
  year =         "2021",
  editor =       "J. Halpern and A. Perea",
  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.",
  pages =        "23--37",
  journal =      "Electronic Proceedings in Theoretical Computer
                 Science",
  volume =       "335",
  bibsource =    "dblp computer science bibliography, https://dblp.org",
  biburl =       "https://dblp.org/rec/journals/corr/abs-2106-11492.bib",
  doi =          "10.4204/EPTCS.335.3",
  timestamp =    "Mon, 05 Jul 2021 13:50:05 +0200",
  URL =          "https://doi.org/10.4204/EPTCS.335.3",
}