A parameterized view on the complexity of dependence and independence logic

DOI10.1093/LOGCOM/EXAC070MaRDI QIDQ5872871zbMATH OpenOpenAlexFDO

Authors Juha Kontinen, Arne Meier, Yasir Mahmood

Publication date 4 January 2023

Published in Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/logcom/exac070

zbMATH Keywords

team semanticsmodel checkingparameterized complexitydependence logicindependence logic

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Computer science (68-XX)

Recommendations

• A parameterized view on the complexity of dependence logic
• Parameterised complexity of model checking and satisfiability in propositional dependence logic
• Parameterised complexity of model checking and satisfiability in propositional dependence logic
• Tractability frontier of data complexity in team semantics
• Tractability Frontier of Data Complexity in Team Semantics

Cited in

(7)

• Parameterized complexity of weighted team definability
• Computer Science Logic
• Expressivity and Complexity of Dependence Logic
• A fragment of dependence logic capturing polynomial time
• A parameterized view on the complexity of dependence logic
• Parameterized complexity of propositional inclusion and independence logic
• 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 and independence logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5872871)