Satisfiability And Model Checking In Team Based Logics

Satisfiability and Model Checking in Team Based Logics

Dependence and independence between properties is occurring in many different scientific disciplines, for example in the description of discrete systems or during the evaluation of physical experiments. During this thesis we will study a variety of team based logics, which can express some form of dependence or independence. The concept of expressing functional dependencies between terms by atomic FO-formulae was introduced by Väänänen in 2007. He showed that dependence logic is equally expressive as existential second order logic and thus dependence logic characterises NP. In the first chapter of this thesis we are obtaining a Horn fragment of dependence logic which characterises P. In the second part of this thesis we will study the concept of dependence and independence in the context of team based modal logics. We will study several decision problems for these modal logics, like satisfiability and model checking. Furthermore we will investigate the expressive power of these modal logics. Finally we will give a general notion of team atoms and the properties that they are describing.

Satisfiability and Model Checking in Team Based Logics

Logic, Language, Information, and Computation

Edited in collaboration with FoLLI, the Association of Logic, Language and Information this book constitutes the refereed proceedings of the 27th Workshop on Logic, Language, Information and Communication, WoLLIC 2021, Virtual Event, in October 2021. The 25 full papers presented included 6 invited lectures were fully reviewed and selected from 50 submissions. The idea is to have a forum which is large enough in the number of possible interactions between logic and the sciences related to information and computation.