Abstract
A survey type presentation, introducing the theory of Graphoids and their representation in graphs. Graphoids are temary relations over a finite domain governed by a finite set of axioms. They are intended as models for the representation of irrelevance relations of the form I(X,Z,Y) where (X,Z,Y) in I has the following interpretation: given that the values of the variables in Z are known, the values of the variables in Y can add no further information about the values of the variables in X.
This work was supported by The Fundation for the Promotion of Research at the Technion.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Bibliography
Geiger, D., Towards the Formalization of Informal Dependencies, (M.Sc. Thesis), UCLA Cognitive Systems Lab., Technical Report No. R-102.
Geiger, D., Paz, A., and Pearl, J., "Axioms and algorithms for inferences involving probabilistic independence". To appear in Information and Computation, 1990.
Geiger, D., Graphoids: A Qualitative Framework for Probabilistic Inferences, (Ph.D. Thesis), Cognitive Systems Lab., Technical Report No. R-142.
Geva, R.Y. and Paz, A., Representation of Irrelevance Relations by Annotated Graphs, Technical Report #603, Computer Science Department, Technion-IIT, January 1990.
Or, S., Comparison of Graph-Representation Methods for Graphoids and the Membership Problem. (M.Sc. Thesis), Technion-IIT, 1990.
Paz, A., A Full Characterization of Pseudographoids in Terms of Families of Undirected Graphs, UCLA Cognitive Systems Laboratory, Technical Report 870055 (R-95), 1987.
Pearl, J., and Paz, A., GRAPHOIDS: A Graph-Based Logic for Reasoning about Relevance Relations, "Advances in Artificial Intelligence-II," edited by B. Du Boulay et al., Amsterdam: North-Holland.
Pearl, J., Probabilistic Reasoning in Intelligence Systems: Networks of Plausible Inference. Chapter 3, Morgan-Kaufmann, San Mateo, CA. (1988).
Pearl, J., and Verma, T.S., "The logic of representing dependencies by directed graphs". Proc. 6th Natl. Conf. on AI (AAAI-87), Seattle, 374–379, 1987.
Studeny, M., "Attempts at Axiomatic Description of Conditional Independence," Workshop on Uncertainty in Expert Systems, Alsovice, Chechoslovakia, June 20–23, 1988.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Paz, A. (1991). The theory of graphoids: A survey. In: Ehrig, H., Kreowski, HJ., Rozenberg, G. (eds) Graph Grammars and Their Application to Computer Science. Graph Grammars 1990. Lecture Notes in Computer Science, vol 532. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0017416
Download citation
DOI: https://doi.org/10.1007/BFb0017416
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54478-4
Online ISBN: 978-3-540-38395-6
eBook Packages: Springer Book Archive