TY  -  
T1  - A finite axiomatization of conditional independence and inclusion dependencies 
SN  -  /  
UR  - http://hdl.handle.net/10138/136272 
T3  - Lecture Notes in Computer Science 
A1  - Hannula, Miika; Kontinen, Juha 
A2  - Beierle, Christoph; Meghini, Carlo 
PB  - Springer Science+Business Media 
Y1  - 2014 
LA  - eng 
AB  - We present a complete finite axiomatization of the unrestricted implication problem for inclusion and conditional independence atoms in the context of dependence logic. For databases, our result implies a finite axiomatization of the unrestricted implication problem for inclusion, functional, and embedded multivalued dependencies in the unirelational case.... 
VO  -  
IS  -  
SP  -  
OP  -  
KW  - math.LO; cs.AI; cs.DB; cs.LO; 03C80; F.4.1; 111 Mathematics 
N1  -   
PP  -  
ER  -