On the complexity of graded modal logics with converse

DOI10.1007/978-3-030-19570-0_42OpenAlexW2905199121MaRDI QIDQ2296751FDOQ2296751

Authors Bartosz Bednarczyk, Emanuel Kieroński, Piotr Witkowski

Publication date 18 February 2020

Full work available at URL https://arxiv.org/abs/1812.04413

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Recommendations

• Completing the Picture: Complexity of Graded Modal Logics with Converse
• Undecidability of the transitive graded modal logic with converse
• scientific article; zbMATH DE number 1670490
• A note on graded modal logic
• On the complexity of elementary modal logics
• On the complexity of modal separation logics
• scientific article; zbMATH DE number 1303624
• Finite-Chain Graded Modal Logic
• Complexity of modal logics with Presburger constraints
• scientific article; zbMATH DE number 1989660

Cited in

(1)

• Completing the Picture: Complexity of Graded Modal Logics with Converse

This page was built for publication: On the complexity of graded modal logics with converse

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2296751)