scientific article; zbMATH DE number 1500520

zbMATH Open0953.03052MaRDI QIDQ4501537FDOQ4501537

Authors: Edith Hemaspaandra 

Publication date: 29 January 2001

Title of this publication is not available (Why is that?)

Recommendations

• The complexity of poor man's logic
• Adding clauses to poor man's logic (without increasing the complexity)
• On the complexity of elementary modal logics
• On the complexity of fragments of modal logics
• The computational complexity of the satisfiability of modal Horn clauses for modal propositional logics

zbMATH Keywords

modal logiccomplexity of modal satisfiability problems

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Modal logic (including the logic of norms) (03B45) Complexity of computation (including implicit computational complexity) (03D15)

Cited In (16)

• Generalized satisfiability for the description logic \(\mathcal{ALC}\)
• Expressivity and Complexity of Dependence Logic
• Title not available (Why is that?)
• Decomposability helps for deciding logics of knowledge and belief
• A polynomial space construction of tree-like models for logics with local chains of modal connectives
• The complexity of poor man's logic
• A note on the complexity of \textbf{S4.2}
• Generalized modal satisfiability
• Adding clauses to poor man's logic (without increasing the complexity)
• The complexes of Peter Sellers
• The complexity of one-agent refinement modal logic
• Generalized satisfiability for the description logic \(\mathcal{ALC}\) (extended abstract)
• Characterizing the NP-PSPACE Gap in the Satisfiability Problem for Modal Logic
• A note on the complexity of the satisfiability of modal Horn clauses
• The price of universality
• On the influence of confluence in modal logics

This page was built for publication:

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