On the Complexity of Graded Modal Logics with Converse

12/11/2018
by   Bartosz Bednarczyk, et al.
0

A complete classification of the complexity of the local and global satisfiability problems for graded modal language over traditional classes of frames has already been established. By 'traditional' classes of frames we mean those characterized by any positive combination of reflexivity, seriality, symmetry, transitivity, and the Euclidean property. In this paper we fill the gaps remaining in an analogous classification of the graded modal language with graded converse modalities. In particular we show its NExpTime-completeness over the class of Euclidean frames, demonstrating this way that over this class the considered language is harder than the language without graded modalities or without converse modalities. We also consider its variation disallowing graded converse modalities, but still admitting basic converse modalities. Our most important result for this variation is confirming an earlier conjecture that it is decidable over transitive frames. This contrasts with the undecidability of the language with graded converse modalities.

READ FULL TEXT
research
05/19/2009

A Note on the Complexity of the Satisfiability Problem for Graded Modal Logics

Graded modal logic is the formal language obtained from ordinary (propos...
research
12/30/2020

Satisfiability problems on sums of Kripke frames

We consider the operation of sum on Kripke frames, where a family of fra...
research
11/21/2019

Recursive enumerability and elementary frame definability in predicate modal logic

We investigate the relationship between recursive enumerability and elem...
research
03/24/2023

Paraconsistent Gödel modal logic on bi-relational frames

We further develop the paraconsistent Gödel modal logic. In this paper, ...
research
04/05/2020

Simpler completeness proofs for modal logics with intersection

There has been a significant interest in extending various modal logics ...
research
07/11/2023

Simple Axioms for Local Properties

Correspondence theory allows us to create sound and complete axiomatizat...
research
03/17/2023

Decidability of modal logics of non-k-colorable graphs

We consider the bimodal language, where the first modality is interprete...

Please sign up or login with your details

Forgot password? Click here to reset