Technical Report CS0678

TR#:CS0678
Class:CS
Title: THE REPRESENTATION POWER OF PROBABILISTIC KNOWLEDGE BY UNDIRECTED GRAPHS AND DIRECTED ACYCLIC GRAPHS . A COMPARISON
Authors: S. Ur and A. Paz
PDF - RevisedCS0678.revised.pdf
Abstract: Two modes of representation of probabilistic knowledge are considered: by undirected graphs (UG's) and by directed acyclic graphs (DAG's). It is shown thaty there is a UG such that the knowledge represented in it requires exponentially many (in the number of vertices of the UG) DAG's for its representation and there is a DAG such that the knowledge represented in it requires exponentially many UG's for its representation. It is thus shown that the two modes of representation are uncomparable as to their representation power. \newpage
CopyrightThe above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information

Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1991/CS/CS0678), rather than to the URL of the PDF files directly. The latter URLs may change without notice.

To the list of the CS technical reports of 1991
To the main CS technical reports page

Computer science department, Technion
admin