We study the complexity of reasoning tasks for logics in team semantics. Our main focus is on the data complexity of model checking but we also derive new results for logically defined counting and enumeration problems. Our approach is based on modular reductions of these problems into the corresponding problems of various classes of Boolean formulas. We illustrate our approach via several new tractability/intractability results.
@article{arxiv.2204.00576,
title = {Modular SAT-based techniques for reasoning tasks in team semantics},
author = {Arnaud Durand and Juha Kontinen and Jouko Väänänen},
journal= {arXiv preprint arXiv:2204.00576},
year = {2022}
}