Parameterized complexity of weighted team definability
From MaRDI portal
Publication:6620025
DOI10.1017/S0960129524000033MaRDI QIDQ6620025
Yasir Mahmood, Arne Meier, Juha Kontinen, Heribert Vollmer
Publication date: 16 October 2024
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
parameterized complexitydependence logicteam semanticsdescriptive complexityindependence logicinclusion logicweighted definability
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fundamentals of parameterized complexity
- Propositional team logics
- Inclusion and exclusion dependencies in team semantics -- on some logics of imperfect information
- On definability in dependence logic
- Probabilistic team semantics
- Enumeration complexity of poor man's propositional dependence logic
- Dependence and independence
- Enumerating teams in first-order team logics
- Parametrized complexity theory.
- Complexity of Propositional Logics in Team Semantic
- Satisfiability of Modal Inclusion Logic
- Tractability Frontier of Data Complexity in Team Semantics
- Counting of Teams in First-Order Team Logics
- 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
This page was built for publication: Parameterized complexity of weighted team definability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6620025)
