Complexity of the Model Checking problem for inquisitive propositional and modal logic

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Grilletti, Gianluca, Ciardelli, Ivano
Format: Preprint
Published: 2024
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866909154525839360
author Grilletti, Gianluca
Ciardelli, Ivano
author_facet Grilletti, Gianluca
Ciardelli, Ivano
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2403_14260
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Complexity of the Model Checking problem for inquisitive propositional and modal logic
Grilletti, Gianluca
Ciardelli, Ivano
Logic in Computer Science
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.
title Complexity of the Model Checking problem for inquisitive propositional and modal logic
topic Logic in Computer Science
Logic
url https://arxiv.org/abs/2403.14260