- From: Antoine Isaac <aisaac@few.vu.nl>
- Date: Tue, 28 Aug 2012 21:45:34 +0200
- To: <public-esw-thes@w3.org>
Hi Thomas, I am not 100% certain I get the constraints that you have on expressing "mappings" in your scenario. You could have an OWL-based solution: 1. Define the set of concepts that belong to either concept scheme (collection, whatever) some:CityOrArea owl:equivalentClass [ owl:intersectionOf ( skos:Concept [ rdf:type owl:Restriction ; owl:onProperty skos:inScheme ; owl:someValuesFrom [ owl:oneOf ( a:cities b:areas )] ] ) ] . 2. If you want to go one step beyond and "populate" a new concept scheme, you can create another axiom some:CityOrArea rdfs:subClassOf [ rdf:type owl:Restriction ; owl:onProperty skos:inScheme ; owl:someValuesFrom [ owl:oneOf ( c:citiesAndAreas )] ] I think that should do it. In any case I know there's something in OWL that does it. As an alternative, you can "populate" directly your concept scheme with skos:inScheme statements using a SPARQL construct: CONSTRUCT { ?c skos:inScheme c:citiesAndAreas } WHERE { { ?c skos:inScheme a:cities } UNION { ?c skos:inScheme b:areas } } Does any of this address your need? Cheers, Antoine > Hi Antoine, > > my use case is data integration. > > Dataset A has defined concept scheme (or collection or subclass) > a:cities as a value set. > Dataset B has defined concept scheme (or collection or subclass) b:areas > as a value set. > > Now I want to have some agent X to query both (and further) datasets. > I want a query builder where users can pick cross-dataset search > conditions from a list. > > To support this, X defines a concept scheme x:location which is the set > union of a:cities and b:area. > Each concept in x:location will have skos:inScheme a:cities and/or > b:area, sure. > The set of referred concept schemes can be inferred from this. > But I would like to describe the intention in one explicit statement. > > This is why I am looking for a mapping relation between such subsets of > concepts. > > Best regards, > Thomas > > Am 22.08.2012 21:15, schrieb Antoine Isaac: >> (3) >> I'm not sure I get the question. If they exist, such mapping >> properties could be very difficult to semantically define. Would a >> concept scheme be broader, equivalent, narrower than another one? >> Rather, I'd say that the property you're after indicates that some >> concepts from these two concept schemes are connected. For this I >> think one could use general linkage properties between datasets, such >> as voiD's linksets [2]. > >
Received on Tuesday, 28 August 2012 19:46:03 UTC