- From: Sergey Melnik <melnik@db.stanford.edu>
- Date: Tue, 15 Jan 2002 12:14:56 -0800
- To: Danny Ayers <danny666@virgilio.it>
- CC: Www-Rdf-Logic <www-rdf-logic@w3.org>
Danny, the paper http://dbpubs.stanford.edu/pub/2002-1 describes a so-called "Similarity Flooding" algorithm for general-purpose graph matching. Best, Sergey Danny Ayers wrote: > > Could anyone please point me in the direction of any work done on ways of > mapping between different vocabularies, schemas and their models. There's > obviously been a fair bit of work been done on things like mapping RDBMS > schema to XML schema or object models, but what I'm after is a more generic, > 'meta' form of this. Terms like 'equivalentTo' would work in this context, > but what would be really nice would be to find a whole RDF Schema in this > space ;-) > > The particular application I have in mind only needs a narrow aspect of this > : more or less one-to-one mapping between an arbitrary domain-specific graph > based model (such as that of a hierarchical organisation) and a general-case > graph (just nodes & arcs here), but the ability to map from one model to > another enables the reasoning facilities (i.e. algorithms) of the second > model to be applied to the first, which is an approach that strikes me as > being ideal for SW work, but rather neglected (ok, this is something that is > done a lot through the back door, e.g. using the Rete algorithm in Jess > plugged into from Protege, but the mapping is, meta-speaking, usually > hard-coded). If I do have to come up with my own RDFS, then it might as well > be based on a reasonably general case (rather than the feeble attempts I've > tried so far). > > Cheers, > Danny. > > --- > > Danny Ayers > <stuff> http://www.isacat.net </stuff>
Received on Tuesday, 15 January 2002 14:45:19 UTC