Parameterized modal satisfiability
type: Item
instance of: scholarly article
title: Parameterized modal satisfiability
zbMATH Open document ID: 1283.68157
author: Antonis Achilleos
author: Michael Lampis
author: Valia Mitsou
published in: Algorithmica
publication date: 2012-11-21T00:00:00Z
full work available at URL: http://urn.kb.se/resolve
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 03D15
Mathematics Subject Classification ID: 03B45
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 6109461
zbMATH Keywords: modal logic
zbMATH Keywords: parameterized complexity
zbMATH Keywords: satisfiability problems
MaRDI profile type: Publication
OpenAlex ID: W1985294169
cites work: Q3408862
cites work: Q5465436
cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
cites work: Q4845472
cites work: Q4931900
cites work: The complexity of first-order and monadic second-order logic revisited
cites work: The complexity of homomorphism and constraint satisfaction problems seen from the other side
cites work: The effect of bounding the number of primitive propositions and the depth of nesting on the complexity of modal logic
cites work: A guide to completeness and complexity for modal logics of knowledge and belief
cites work: Characterizing the NP-PSPACE Gap in the Satisfiability Problem for Modal Logic
cites work: The Computational Complexity of Provability in Systems of Modal Propositional Logic
cites work: Q5483012
cites work: Q4833777
cites work: Q4414647
DOI: 10.1007/S00453-011-9552-Z
description: scientific article; zbMATH DE number 6109461