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

by J. Pena, R. Nilsson, J. Björkegren, J. Tegnér
Year:2006

Bibliography

Reading dependencies from the minimal undirected independence map of a graphoid that satisfies weak transitivity
J. Pena, R. Nilsson, J. Björkegren, and J. Tegnér
EWGP, 247-254, 2006

Abstract

​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

 

Keywords

Graphical criteria Sound and complete Weak transitivity
KAUST

"KAUST shall be a beacon for peace, hope and reconciliation, and shall serve the people of the Kingdom and the world."

King Abdullah bin Abdulaziz Al Saud, 1924 – 2015

Contact Us

  • 4700 King Abdullah University of Science and Technology

    Thuwal 23955-6900, Kingdom of Saudi Arabia

     

Quick links

© King Abdullah University of Science and Technology. All rights reserved