Completing the Picture: Complexity of Graded Modal Logics with Converse
From MaRDI portal
Publication:6063859
DOI10.1017/s1471068421000065zbMath1529.68115arXiv1812.04413OpenAlexW3157387870MaRDI QIDQ6063859
Emanuel Kieroński, Piotr Witkowski, Bartosz Bednarczyk
Publication date: 12 December 2023
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1812.04413
Analysis of algorithms and problem complexity (68Q25) Modal logic (including the logic of norms) (03B45) Computational aspects of satisfiability (68R07)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the complexity of graded modal logics with converse
- Deciding regular grammar logics with converse through first-order logic
- Complexity of the two-variable fragment with counting quantifiers
- PSPACE Reasoning for Graded Modal Logics
- An Introduction to Description Logic
- Undecidability of the transitive graded modal logic with converse
- Complexity of the Guarded Two-variable Fragment with Counting Quantifiers
- How Many Legs Do I Have? Non-Simple Roles in Number Restrictions Revisited
- The Computational Complexity of Provability in Systems of Modal Propositional Logic
- On the Computational Complexity of the Numerically Definite Syllogistic and Related Logics
- The complexity of theorem-proving procedures
This page was built for publication: Completing the Picture: Complexity of Graded Modal Logics with Converse