Complexity results for modal dependence logic
type: Item
instance of: scholarly article
title: Complexity results for modal dependence logic
zbMATH Open document ID: 1432.03043
author: Peter Lohmann
author: Heribert Vollmer
published in: Studia Logica
publication date: 2013-06-13T00:00:00Z
full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2010/2524/
Mathematics Subject Classification ID: 03B60
Mathematics Subject Classification ID: 03B45
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 6175507
zbMATH Keywords: dependence logic
zbMATH Keywords: modal logic
zbMATH Keywords: satisfiability problem
zbMATH Keywords: computational complexity
zbMATH Keywords: poor man's logic
MaRDI profile type: Publication
OpenAlex ID: W2003216212
cites work: From IF to BI. A tale of dependence and separation
cites work: The complexity of problems for quantified constraints
cites work: The complexity of theorem-proving procedures
cites work: The complexity of existential quantification in concept languages.
cites work: The complexity of poor man's logic
cites work: Generalized modal satisfiability
cites work: Q5732647
cites work: Q4732440
cites work: The Computational Complexity of Provability in Systems of Modal Propositional Logic
cites work: Satisfiability problems for propositional calculi
cites work: Complexity Results for Modal Dependence Logic
cites work: The Complexity of Satisfiability for Fragments of CTL and CTL⋆
cites work: Lower bounds for multiplayer noncooperative games of incomplete information
cites work: Model-theoretic and Computational Properties of Modal Dependence Logic
cites work: Q3446107
cites work: Q4599513
cites work: Complete sets and the polynomial-time hierarchy
DOI: 10.1007/S11225-013-9483-6
description: scientific article; zbMATH DE number 6175507