On the complexity of fragments of modal logics

zbMATH Open1102.03018MaRDI QIDQ5483012FDOQ5483012

Linh Anh Nguyen

Publication date: 15 August 2006

zbMATH Keywords

satisfiabilitynormal modal logicmultimodal logicsHorn fragmentmonomodal logicsbounded modal depth

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Complexity of computation (including implicit computational complexity) (03D15)

Cited In (24)

• Title not available (Why is that?)
• The computational complexity of the satisfiability of modal Horn clauses for modal propositional logics
• Complexity of finite-variable fragments of products with non-transitive modal logics
• Modal logics with hard diamond-free fragments
• Decidability and complexity of the fragments of the modal logic of Allen's relations over the rationals
• Characterizing and extending answer set semantics using possibility theory
• Title not available (Why is that?)
• Modal languages and bounded fragments of predicate logic
• VARIETIES OF POSITIVE MODAL ALGEBRAS AND STRUCTURAL COMPLETENESS
• Title not available (Why is that?)
• Title not available (Why is that?)
• Boolean logics with relations
• Depth-bounded Epistemic Logic
• Title not available (Why is that?)
• Coinductive models and normal forms for modal logics (or how we learned to stop worrying and love coinduction)
• Boolean Logics with Relations
• The Complexity of Decomposing Modal and First-Order Theories
• Complete Abstractions and Subclassical Modal Logics
• Complexity of finite-variable fragments of propositional temporal and modal logics of computation
• Title not available (Why is that?)
• Title not available (Why is that?)
• Parameterized modal satisfiability
• Title not available (Why is that?)
• On non-self-referential fragments of modal logics

   Recommendations

• The computational complexity of the satisfiability of modal Horn clauses for modal propositional logics 👍 👎
• On the Decidability of Elementary Modal Logics 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• A note on the complexity of the satisfiability of modal Horn clauses 👍 👎

This page was built for publication: On the complexity of fragments of modal logics

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