Computational complexity of core fragments of modal logics t, K4, and S4

DOI10.1007/978-3-030-19570-0_48MaRDI QIDQ2296757zbMATH OpenOpenAlexFDO

Authors Przemysław Andrzej Wałęga

Publication date 18 February 2020

Full work available at URL https://doi.org/10.1007/978-3-030-19570-0_48

zbMATH Keywords

computational complexitymodal logicsub-propositional fragments

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Recommendations

• On the complexity of fragments of modal logics
• scientific article; zbMATH DE number 6917935
• Complexity of model checking for logics over Kripke models
• The complexity of propositional linear temporal logics
• The computational complexity of the satisfiability of modal Horn clauses for modal propositional logics

Cited in

(2)

• Computational complexity of hybrid interval temporal logics
• scientific article; zbMATH DE number 1418348 (Why is no real title available?)

This page was built for publication: Computational complexity of core fragments of modal logics \(\mathrm{t}\), \(\mathrm{K4}\), and \(\mathrm{S4}\)

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