Conceptual structures: information processing in mind and machine
Conceptual structures: information processing in mind and machine
Fusion, propagation, and structuring in belief networks
Artificial Intelligence
Multivalued dependencies and a new normal form for relational databases
ACM Transactions on Database Systems (TODS)
Inferences involving embedded multivalued dependencies and transitive dependencies
SIGMOD '80 Proceedings of the 1980 ACM SIGMOD international conference on Management of data
Subjective bayesian methods for rule-based inference systems
AFIPS '76 Proceedings of the June 7-10, 1976, national computer conference and exposition
Some complexity considerations in the combination of belief networks
UAI'93 Proceedings of the Ninth international conference on Uncertainty in artificial intelligence
Deriving a minimal I-map of a belief network relative to a target ordering of its nodes
UAI'93 Proceedings of the Ninth international conference on Uncertainty in artificial intelligence
Reversibility and equivalence in directed markov fields
Mathematical and Computer Modelling: An International Journal
Local characterizations of causal bayesian networks
GKR'11 Proceedings of the Second international conference on Graph Structures for Knowledge Representation and Reasoning
Representation of Irrelevance Relations by Annotated Graphs
Fundamenta Informaticae
Computer Methods and Programs in Biomedicine
Hi-index | 0.00 |
Data-dependencies of the type "x can tell us more about y given that we already know z" can be represented in various formalisms: Probabilistic Dependencies, Embedded-Multi-Valued Dependencies, Undirected Graphs and Directed-Acyclic Graphs (DAGs). This paper provides an axiomatic basis, called a semigraphoid, which captures the structure common to all four types of dependencies and explores the expressive power of DAGs in representing various types of data dependencies. It is shown that DAGs can represent a richer set of dependencies than undirected graphs, that DAGs completely represent the closure of their specification bases, and that they offer an effective computational device for testing membership in that closure as well as inferring new dependencies from given inputs. These properties might explain the prevailing use of DAGs in causal reasoning and semantic nets.