Independence in Database Relations

DOI10.1007/978-3-642-39992-3_17zbMath1394.68116OpenAlexW2288986418MaRDI QIDQ2849431

Jouko Väänänen, Juha Kontinen, Sebastian Link

Publication date: 17 September 2013

Published in: Logic, Language, Information, and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-39992-3_17

Mathematics Subject Classification ID

Database theory (68P15) Logic in computer science (03B70) Decidability of theories and sets of sentences (03B25)

Related Items (15)

On the finite and general implication problems of independence atoms and keys ⋮ A finite axiomatization of conditional independence and inclusion dependencies ⋮ Capturing \(k\)-ary existential second order logic with \(k\)-ary inclusion-exclusion logic ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The expressive power of \(k\)-ary exclusion logic ⋮ Approximation and dependence via multiteam semantics ⋮ CHARACTERIZING DOWNWARDS CLOSED, STRONGLY FIRST-ORDER, RELATIVIZABLE DEPENDENCIES ⋮ Safe dependency atoms and possibility operators in team semantics ⋮ On Strongly First-Order Dependencies ⋮ Approximation Logics for Subclasses of Probabilistic Conditional Independence and Hierarchical Dependence on Incomplete Data ⋮ Frontiers for propositional reasoning about fragments of probabilistic conditional independence and hierarchical database decompositions ⋮ The Expressive Power of k-ary Exclusion Logic ⋮ On Dependence Logic

This page was built for publication: Independence in Database Relations