Parameterized complexity of propositional inclusion and independence logic
From MaRDI portal
Publication:6199587
DOI10.1007/978-3-031-39784-4_17arXiv2105.14887OpenAlexW4386232019MaRDI QIDQ6199587
Publication date: 28 February 2024
Published in: Logic, Language, Information, and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2105.14887
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A logical approach to context-specific independence
- Fundamentals of parameterized complexity
- Complexity of validity for propositional dependence logics
- Inclusion and exclusion dependencies in team semantics -- on some logics of imperfect information
- Probabilistic team semantics
- Enumeration complexity of poor man's propositional dependence logic
- Approximation and dependence via multiteam semantics
- Complexity results for modal dependence logic
- A logic for arguing about probabilities in measure teams
- Parametrized complexity theory.
- Extended Modal Dependence Logic $\mathcal{EMDL}$
- Complexity of Model Checking for Modal Dependence Logic
- Complexity of Propositional Independence and Inclusion Logic
- Complexity of Propositional Logics in Team Semantic
- Team semantics for the specification and verification of hyperproperties
- The expressive power of modal logic with inclusion atoms
- Polyteam semantics
- Descriptive complexity of real computation and probabilistic independence logic
- Model checking and validity in propositional and modal inclusion logics
- A parameterized view on the complexity of dependence and independence logic
- Parameterised complexity of model checking and satisfiability in propositional dependence logic
- Lower bounds for multiplayer noncooperative games of incomplete information
This page was built for publication: Parameterized complexity of propositional inclusion and independence logic
