Building trees with Greg

From Vision Wiki

Revision as of 00:53, 31 January 2007 by Merrielle (talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

coocurrence of object names

A,B; B,C; not A,C weak implication A<-B->C

could use Pearl's IC* to do this, or maybe just IC?

Retrieved from "https://visionwiki.caltech.edu/index.php?title=Building_trees_with_Greg&oldid=15578"