Generalized modal satisfiability

DOI10.1016/j.jcss.2009.10.011zbMath1197.68048OpenAlexW2091470957MaRDI QIDQ988571

Henning Schnoor, Edith Hemaspaandra, Ilka Schnoor

Publication date: 18 August 2010

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2009.10.011

zbMATH Keywords

computational complexitymodal logic

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modal logic (including the logic of norms) (03B45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (7)

Parametrised Complexity of Satisfiability in Temporal Logic ⋮ Modal Logics with Hard Diamond-Free Fragments ⋮ Complexity of Model Checking for Modal Dependence Logic ⋮ Generalized satisfiability for the description logic \(\mathcal{ALC}\) ⋮ Complexity results for modal dependence logic ⋮ Quirky Quantifiers: Optimal Models and Complexity of Computation Tree Logic ⋮ Generalized Satisfiability for the Description Logic $\mathcal{ALC}$

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Attributive concept descriptions with complements
• Belief, information acquisition, and trust in multi-agent systems -- a modal logic formulation
• A unifying semantics for time and events
• The complexity of existential quantification in concept languages.
• A guide to completeness and complexity for modal logics of knowledge and belief
• The complexity of concept languages
• Optimal satisfiability for propositional calculi and constraint satisfaction problems.
• The price of universality
• The effect of bounding the number of primitive propositions and the depth of nesting on the complexity of modal logic
• The Complexity of Poor Man's Logic
• Modal Logics for Cryptographic Processes
• Enumerating All Solutions for Constraint Satisfaction Problems
• The complexity of propositional linear temporal logics
• Satisfiability problems for propositional calculi
• The Computational Complexity of Provability in Systems of Modal Propositional Logic
• Closure properties of constraints
• The Tractability of Model-checking for LTL: The Good, the Bad, and the Ugly Fragments
• Function Algebras on Finite Sets
• The complexity of satisfiability problems
• Generalized Modal Satisfiability
• The Complexity of Generalized Satisfiability for Linear Temporal Logic
• The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)
• On boolean lowness and boolean highness

This page was built for publication: Generalized modal satisfiability