Kontinen, Juha

English

Dagstuhl Research Online Publication Server

Computational Aspects of Logics in Team Semantics (Tutorial)

Helsingin yliopiston digitaalinen arkisto

https://helda.helsinki.fiComputational Aspects of Logics in Team Semantics (Tutorial)Kontinen, JuhaSchloss Dagstuhl - Leibniz-Zentrum für Informatik2017Kontinen , J 2017 , Computational Aspects of Logics in Team Semantics (Tutorial) . in Hþÿ V o l l m e r   &   B   V a l l e e   ( e d s )   ,   3 4 t h   S y m p o s i u m   o n   T h e o r e t i c a l   A s p e c t s   o f   C o m p u t e r   S c i e n c e(STACS 2017) . vol. 66 , 1 , Leibniz international proceedings in informatics , vol. 66 ,Schloss Dagstuhl - Leibniz-Zentrum für Informatik , Dagstuhl, Germany , pp. 1:1-1:1 ,Symposium on Theoretical Aspects of Computer Science , Hannover , Germany ,08/03/2017 . https://doi.org/10.4230/LIPIcs.STACS.2017.1http://hdl.handle.net/10138/232340https://doi.org/10.4230/LIPIcs.STACS.2017.1cc_bypublishedVersionDownloaded from Helda, University of Helsinki institutional repository.This is an electronic reprint of the original article.This reprint may differ from the original in pagination and typographic detail.Please cite the original version.Computational Aspects of Logics in TeamSemanticsJuha KontinenDepartment of Mathematics and Statistics, University of Helsinki, Helsinki,Finlandjuha.kontinen@helsinki.fiAbstractTeam Semantics is a logical framework for the study of various dependency notions that are im-portant in many areas of science. The starting point of this research is marked by the publicationof the monograph Dependence Logic (Jouko Väänänen, 2007) in which first-order dependencelogic is developed and studied. Since then team semantics has evolved into a flexible frameworkin which numerous logics have been studied.Much of the work in team semantics has so far focused on results concerning either axiomaticcharacterizations or the expressive power and computational aspects of various logics. This tu-torial provides an introduction to team semantics with a focus on results regarding expressivityand computational aspects of the most prominent logics of the area. In particular, we discussdependence, independence and inclusion logics in first-order, propositional, and modal teamsemantics. We show that first-order dependence and independence logic are equivalent withexistential second-order logic and inclusion logic with greatest fixed point logic. In the proposi-tional and modal settings we characterize the expressive power of these logics by so-called teambisimulations and determine the complexity of their model checking and satisfiability problems.1998 ACM Subject Classification F.4.1 Mathematical LogicKeywords and phrases team semantics, dependence logic, model checking, satisfiability problem,team bisimulationDigital Object Identifier 10.4230/LIPIcs.STACS.2017.1Category Tutorial© Juha Kontinen;licensed under Creative Commons License CC-BY34th Symposium on Theoretical Aspects of Computer Science (STACS 2017).Editors: Heribert Vollmer and Brigitte Vallée; Article No. 1; pp. 1:1–1:1Leibniz International Proceedings in InformaticsSchloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germany

https://helda.helsinki.fi/bitstream/10138/232340/1/LIPIcs_STACS_2017_1.pdf

Computational Aspects of Logics in Team Semantics (Tutorial)

Abstract

Similar works

Full text

Available Versions

Dagstuhl Research Online Publication Server

Helsingin yliopiston digitaalinen arkisto