Querying Visible and Invisible Information - Archive ouverte HAL Access content directly
Conference Papers Year : 2016

Querying Visible and Invisible Information

Abstract

We provide a wide-ranging study of the scenario where a subset of the relations in the schema are visible - that is, their complete contents are known - while the remaining relations are invisible. We also have integrity constraints (invariants given by logical sentences) which may relate the visible relations to the invisible ones. We want to determine which information about a query (a positive existential sentence) can be inferred from the visible instance and the constraints. We consider both positive and negative query information, that is, whether the query or its negation holds. We consider the instance-level version of the problem, where both the query and the visible instance are given, as well as the schema-level version, where we want to know whether truth or falsity of the query can be inferred in some instance of the schema.
Fichier principal
Vignette du fichier
LICS 2016.pdf (184.21 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01411118 , version 1 (07-12-2016)

Identifiers

Cite

Pierre Bourhis, Michael Benedikt, Balder ten Cate, Gabriele Puppis. Querying Visible and Invisible Information. LICS 2016 - 31st Annual ACM/IEEE Symposium on Logic in Computer Science, Jul 2016, New York City, United States. pp.297-306 ⟨10.1145/2933575.2935306⟩. ⟨hal-01411118⟩
202 View
156 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More