Algebraic Dependencies
We propose a new kind of data dependencies called algebraic dependencies, which generalize all previous known kinds. We give a complete axiomatization of algebraic dependencies in terms of simple algebraic rewriting rules. In the process we characterize exactly the expressive power of tableaux, thus...
Main Authors: | Yannakakis, Mihalis, Papadimitrou, Christos H. |
---|---|
Published: |
2023
|
Online Access: | https://hdl.handle.net/1721.1/149004 |
Similar Items
-
Recursive Concurrent Stochastic Games
by: Kousha Etessami, et al.
Published: (2008-11-01) -
How Good is the Chord Algorithm?
by: Yannakakis, Mihalis, et al.
Published: (2018) -
An Optimality Theory of Concurrency Control for Databases
by: Kung, Hsing-Tsung, et al.
Published: (2023) -
Multi-Objective Model Checking of Markov Decision Processes
by: Kousha Etessami, et al.
Published: (2008-11-01) -
Algebra of Programming using Dependent Types
by: Mu, S, et al.
Published: (2008)