Generalized Modal Satisfiability

DOI10.1007/11672142_41MaRDI QIDQ5449825zbMATH OpenOpenAlexFDO

Authors Michael Bauland, Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor

Publication date 19 March 2008

Published in STACS 2006 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11672142_41

zbMATH Keywords

computational complexitymodal logic

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modal logic (including the logic of norms) (03B45)

Recommendations

• Generalized modal satisfiability
• Generalized quantifiers and modal logic
• Parameterized modal satisfiability
• Parameterized modal satisfiability
• Modal Satisfiability via SMT Solving
• Towards a generalization of modal definability
• scientific article; zbMATH DE number 5295712
• scientific article; zbMATH DE number 1252393
• scientific article; zbMATH DE number 140385

Cited in

(12)

• The complexity of satisfiability for fragments of hybrid logic. I.
• The complexity of circumscriptive inference in Post's lattice
• Generalized modal satisfiability
• The Complexity of Satisfiability for Fragments of Hybrid Logic—Part I
• On the applicability of Post's lattice
• Parameterized modal satisfiability
• scientific article; zbMATH DE number 1670487 (Why is no real title available?)
• Lewis dichotomies in many-valued logics
• The tractability of model-checking for LTL: the good, the bad, and the ugly fragments
• Parameterized modal satisfiability
• Generalized Davis-Putnam and satisfiability problems in mathematics
• Generalised modal realisation as a practical and efficient tool for FWL implementation

This page was built for publication: Generalized Modal Satisfiability

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