Steve, How severe would you consider a restriction on RDF graphs that would allow at most one incoming and at most one outgoing edge with a given label, for capability descriptions? This would allow to do unification (and generalization aka. intersection) on graphs easily (not as easily as on terms, but nearly). Outside the system where it would be needed (I have automatic programming / program analysis in mind), the theory/graphs can be extended of course. For example, the parenting relation would have to be split into "x offspring_i y" means "x is the i-th offspring of y", and we could also add "outgoing" and "incoming" restrictions, e.g. that a node cannot have incoming "offspring_i" and "offspring_j" edges for i <> j. Outside, we would have the implication "x offspring_i y ==> x offspring y".
Best wishes. ------------------------------------------- agi Archives: http://www.listbox.com/member/archive/303/=now RSS Feed: http://www.listbox.com/member/archive/rss/303/ Modify Your Subscription: http://www.listbox.com/member/?member_id=8660244&id_secret=103754539-40ed26 Powered by Listbox: http://www.listbox.com
