THE REPRESENTATION POWER OF PROBABILISTIC KNOWLEDGE BY UNDIRECTED GRAPHS AND DIRECTED ACYCLIC GRAPHS: A COMPARISON

DOI10.1080/03081079308935208zbMath0806.68101OpenAlexW2091046299MaRDI QIDQ4296636

Azaria Paz, Shmuel Ur

Publication date: 13 February 1995

Published in: International Journal of General Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081079308935208

zbMATH Keywords

directed acyclic graphsundirected graphsprobabilistic knowledge

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Knowledge representation (68T30)

Related Items (1)

DESCRIPTION OF STRUCTURES OF STOCHASTIC CONDITIONAL INDEPENDENCE BY MEANS OF FACES AND IMSETS 1st part: introduction and basic concepts¹

Cites Work

• Unnamed Item

This page was built for publication: THE REPRESENTATION POWER OF PROBABILISTIC KNOWLEDGE BY UNDIRECTED GRAPHS AND DIRECTED ACYCLIC GRAPHS: A COMPARISON