Parameterized modal satisfiability
DOI10.1007/S00453-011-9552-ZzbMATH Open1283.68157OpenAlexW1985294169MaRDI QIDQ1759682FDOQ1759682
Authors: Antonis Achilleos, Michael Lampis, Valia Mitsou 
Publication date: 21 November 2012
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-58600
Recommendations
Analysis of algorithms and problem complexity (68Q25) 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)
Cites Work
- The complexity of homomorphism and constraint satisfaction problems seen from the other side
- Title not available (Why is that?)
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Title not available (Why is that?)
- Handbook of modal logic
- Title not available (Why is that?)
- Title not available (Why is that?)
- A guide to completeness and complexity for modal logics of knowledge and belief
- The complexity of first-order and monadic second-order logic revisited
- The Computational Complexity of Provability in Systems of Modal Propositional Logic
- Title not available (Why is that?)
- On the complexity of fragments of modal logics
- The effect of bounding the number of primitive propositions and the depth of nesting on the complexity of modal logic
- Characterizing the NP-PSPACE Gap in the Satisfiability Problem for Modal Logic
Cited In (7)
This page was built for publication: Parameterized modal satisfiability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1759682)
