Reading dependencies from the minimal undirected independence map of a graphoid that satisfies weak transitivity

​We present a sound and complete graphical criterion for reading dependencies from the minimal undirected independence map of a graphoid that satisfies weak transitivity. We argue that assuming weak transitivity is not too restrictive.

ISBN: 8086742148;978-808674214-4

Reading dependencies from the minimal undirected independence map.pdf