www.uhasselt.be
DSpace

Document Server@UHasselt >
Research >
Research publications >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/25787

Title: Polyteam Semantics
Authors: Hannula, Miika
Kontinen, Juha
Virtema, Jonni
Issue Date: 2018
Publisher: Springer
Citation: Artemov, Sergei; Nerode, Anil (Ed.). Logical Foundations of Computer Science: International Symposium, LFCS 2018 Deerfield Beach, FL, USA, January 8–11, 2018 Proceedings, Springer, p. 190-210
Series/Report: Lecture Notes in Computer Science
Series/Report no.: 10703
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 polyindependence logic and all ESO-definable properties.
URI: http://hdl.handle.net/1942/25787
DOI: 10.1007/978-3-319-72056-2_12
ISBN: 9783319720555
ISSN: 0302-9743
Category: B2
Type: Book Section
Appears in Collections: Research publications

Files in This Item:

Description SizeFormat
Published version338.88 kBAdobe PDF

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.