This 2002 thesis appears to explain the "right" way to do pattern matching on graphs (he touches on labeled graphs, but the approach should work for labeled hypergraphs too) ...
http://sqrl.mcmaster.ca/~kahl/Publications/RelRew/RelRew_TR2002-03.pdf -- in this approach pattern matching rules are expressed without reference to particular nodes or links, so all matching by default is "up to homomorphism" Among many other things, this would sorta do alpha-conversion automagically behind the scenes... Not suggested for immediate implementation, just putting it out there as something to consider if we ever want to pretty much rebuild the pattern matcher from the ground up ;p ... -- Ben -- Ben Goertzel, PhD http://goertzel.org “I tell my students, when you go to these meetings, see what direction everyone is headed, so you can go in the opposite direction. Don’t polish the brass on the bandwagon.” – V. S. Ramachandran -- You received this message because you are subscribed to the Google Groups "opencog" group. To unsubscribe from this group and stop receiving emails from it, send an email to opencog+unsubscr...@googlegroups.com. To post to this group, send email to opencog@googlegroups.com. Visit this group at https://groups.google.com/group/opencog. To view this discussion on the web visit https://groups.google.com/d/msgid/opencog/CACYTDBf37QHVszs70pao1%3D4de8n2XOp9siDZxdnA4WsWqWh_9Q%40mail.gmail.com. For more options, visit https://groups.google.com/d/optout.
