On the complexity of fragments of modal logics

MaRDI QIDQ5483012zbMATH OpenFDO

Authors 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)

Recommendations

• The computational complexity of the satisfiability of modal Horn clauses for modal propositional logics
• On the decidability of elementary modal logics
• On the complexity of elementary modal logics
• scientific article; zbMATH DE number 6917935
• A note on the complexity of the satisfiability of modal Horn clauses

Cited in

(33)

• scientific article; zbMATH DE number 1989660 (Why is no real title available?)
• On the complexity of elementary modal logics
• Complexity of finite-variable fragments of propositional modal logics of symmetric frames
• 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
• A note on the complexity of \textbf{S4.2}
• Rules with parameters in modal logic. II.
• Modal logics with hard diamond-free fragments
• 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
• scientific article; zbMATH DE number 5872415 (Why is no real title available?)
• Modal languages and bounded fragments of predicate logic
• VARIETIES OF POSITIVE MODAL ALGEBRAS AND STRUCTURAL COMPLETENESS
• Boolean logics with relations
• Complete abstractions and subclassical modal logics
• scientific article; zbMATH DE number 2209833 (Why is no real title available?)
• scientific article; zbMATH DE number 795175 (Why is no real title available?)
• Complexity of logics for multi-agent systems with restricted modal context
• Modal logics and local quantifiers: a zoo in the elementary hierarchy
• Modal logic and the polynomial hierarchy: from QBFs to K and back
• Depth-bounded Epistemic Logic
• Coinductive models and normal forms for modal logics (or how we learned to stop worrying and love coinduction)
• scientific article; zbMATH DE number 1612551 (Why is no real title available?)
• Boolean Logics with Relations
• A note on the complexity of the satisfiability of modal Horn clauses
• The Complexity of Decomposing Modal and First-Order Theories
• Complexity of finite-variable fragments of propositional temporal and modal logics of computation
• Parameterized modal satisfiability
• scientific article; zbMATH DE number 6917935 (Why is no real title available?)
• scientific article; zbMATH DE number 7439733 (Why is no real title available?)
• scientific article; zbMATH DE number 1989649 (Why is no real title available?)
• On non-self-referential fragments of modal logics

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)