| Résume | In the first part of the talk we will make a basic introduction to team semantics and survey the main complexity/expressivity results in this area. In the second part, we
will present a new approach, proposed jointly with Juha Kontinen and Jouko Väänänen based on efficient translation to SAT (the boolean
satisfiability problem) to derive new complexity results for reasoning tasks (such as model-checking, model-counting and enumeration) for algorithmic problems in team semantics. This is joint work with Juha Kontinen and Jouko Väänänen |
