On 5/18/08, Stephen Reed [EMAIL PROTECTED] wrote:
For the others on this list following my progress, the example is from a
set of essential capability descriptions that I'll use to bootstrap the
skill acquisition facility of the the Texai dialog system. The
subsumption-based capability matcher
Word Grammar comes to my mind, where when A -R- B, and A' is-a A,
then you know A' -R- B' where B' is-a B. Because I want to have
lattices (partial orders) in my system anyway, and because nodes of
my graph-terms might be objects of any domain (they can be nested
graph-terms even), they could
] Uninterpreted RDF terms
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
