A parameterized view on the complexity of dependence logic

DOI10.1007/978-3-030-93100-1_9OpenAlexW4205298752MaRDI QIDQ2151403

Yasir Mahmood, Arne Meier, Juha Kontinen

Publication date: 1 July 2022

Full work available at URL: https://arxiv.org/abs/2109.09342

zbMATH Keywords

model checkingparameterized complexitydependence logicteam semantics

Mathematics Subject Classification ID

Logic in computer science (03B70)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fundamentals of parameterized complexity
• Model-checking games for logics of imperfect information
• Inclusion and exclusion dependencies in team semantics -- on some logics of imperfect information
• Elements of finite model theory.
• Graph minors. III. Planar tree-width
• Enumeration complexity of poor man's propositional dependence logic
• Dependence and independence
• Complexity results for modal dependence logic
• Coherence and computational complexity of quantifier-free dependence logic formulas
• On the space and circuit complexity of parameterized problems: classes and completeness
• Hierarchies in Dependence Logic
• First-Order Model Checking Problems Parameterized by the Model
• Complexity of Finding Embeddings in a k-Tree
• Complexity of Propositional Logics in Team Semantic
• Descriptive complexity of real computation and probabilistic independence logic
• On Strongly First-Order Dependencies
• SOFSEM 2005: Theory and Practice of Computer Science
• Parameterised complexity of model checking and satisfiability in propositional dependence logic

This page was built for publication: A parameterized view on the complexity of dependence logic