Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/35842
Title: | Polyteam Semantics | Authors: | Hannula, M Kontinen, J VIRTEMA, Jonni |
Issue Date: | 2018 | Publisher: | SPRINGER INTERNATIONAL PUBLISHING AG | Source: | LOGICAL FOUNDATIONS OF COMPUTER SCIENCE (LFCS 2018), SPRINGER INTERNATIONAL PUBLISHING AG, p. 190 -210 | Series/Report: | Lecture Notes in Computer Science | Abstract: | Team semantics is the mathematical framework of modern logics of dependence and independence in which formulae are interpreted by sets of assignments (teams) instead of single assignments as in first-order logic. In order to deepen the fruitful interplay between team semantics and database dependency theory, we define Polyteam Semantics in which formulae are evaluated over a family of teams. We begin by defining a novel polyteam variant of dependence atoms and give a finite axiomatisation for the associated implication problem. We also characterise the expressive power of poly-dependence logic by properties of polyteams that are downward closed and definable in existential second-order logic (ESO). The analogous result is shown to hold for poly-independence logic and all ESO-definable properties. | Keywords: | Team semantics;Dependency theory;Expressive power | Document URI: | http://hdl.handle.net/1942/35842 | ISBN: | 978-3-319-72055-5 978-3-319-72056-2 |
DOI: | 10.1007/978-3-319-72056-2_12 | ISI #: | 000541559100012 | Category: | C1 | Type: | Proceedings Paper | Validations: | ecoom 2021 |
Appears in Collections: | Research publications |
Show full item record
WEB OF SCIENCETM
Citations
6
checked on May 2, 2024
Page view(s)
44
checked on Aug 25, 2023
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.