Complexity of the Model Checking problem for inquisitive propositional and modal logic
<|reference_start|>Complexity of the Model Checking problem for inquisitive propositional and modal logic: The aim of this paper is to study the complexity of the model checking problem MC for inquisitive propositional logic InqB and for inquisitive modal logic InqM, that is, the problem of deciding whether a given finite structure for the logic satisfies a given formula. In recent years, this problem has been thoroughly investigated for several variations of dependence and teams logics, systems closely related to inquisitive logic. Building upon some ideas presented by Yang, we prove that the model checking problems for InqB and InqM are both AP-complete.<|reference_end|>
@article{grilletti2024complexity,
    title={Complexity of the Model Checking problem for inquisitive propositional
  and modal logic},
    author={Gianluca Grilletti, Ivano Ciardelli},
    journal={arXiv preprint arXiv:2403.14260},
    year={2024},
    archivePrefix={arXiv},
    eprint={2403.14260},
    primaryClass={cs.LO math.LO}
}