@prefix foaf:	<http://xmlns.com/foaf/0.1/> .
@prefix dbpedia:	<http://dbpedia.org/resource/> .
@prefix ns2:	<http://en.wikipedia.org/wiki/> .
dbpedia:Semantic_matching	foaf:page	ns2:Semantic_matching .
@prefix dbpprop:	<http://dbpedia.org/property/> .
dbpedia:Semantic_matching	dbpprop:reference	<http://eprints.biblio.unitn.it/archive/00000531/01/015.pdf> ,
		<http://eprints.biblio.unitn.it/archive/00000967/01/016.pdf> .
@prefix rdfs:	<http://www.w3.org/2000/01/rdf-schema#> .
dbpedia:Semantic_matching	rdfs:label	"Semantic matching"@en ;
	dbpprop:abstract	"Semantic matching is a technique used in Computer Science to identify information which is semantically related. Given any two graph-like structures, e.g. classifications, database or XML schemas and ontologies, matching is an operator which identifies those nodes in the two structures which semantically correspond to one another. For example, applied to file systems it can identify that a folder labeled \u201Ccar\u201D is semantically equivalent to another folder \u201Cautomobile\u201D because they are synonyms in English. This information can be taken from a linguistic resource like WordNet. In the recent years many of them has been offered. A good survey is represented by . S-Match is a good example of semantic matching operator. It works on lightweight ontologies, namely graph structures where each node is labeled by a natural language sentence, for example in English. These sentences are translated into a formal logical formula (according to an artificial unambiguous language) codifying the meaning of the node taking into account its position in the graph. For example, in case the folder \u201Ccar\u201D is under another folder \u201Cred\u201D we can say that the meaning of the folder \u201Ccar\u201D is \u201Cred car\u201D in this case. This is translated into the logical formula \u201Cred AND car\u201D. The output of S-Match is a set of semantic correspondences called mappings attached with one of the following semantic relations: disjointness (\u22A5), equivalence (\u2261), more specific (\u2291) and less specific (\u2292). In our example the algorithm will return a mapping between \u201Dcar\u201D and \u201Dautomobile\u201D attached with an equivalence relation. Semantic matching represents a fundamental technique in many applications in areas such as resource discovery, data integration, data migration, query translation, peer to peer networks, agent communication, schema and ontology merging. In fact, it has been proposed as a valid solution to the semantic heterogeneity problem, namely managing the diversity in knowledge. Interoperability among people of different cultures and languages, having different viewpoints and using different terminology has always been a huge problem. Especially with the advent of the Web and the consequential information explosion, the problem seems to be emphasized. People face the concrete problem to retrieve, disambiguate and integrate information coming from a wide variety of sources."@en ;
	rdfs:comment	"Semantic matching is a technique used in Computer Science to identify information which is semantically related. Given any two graph-like structures, e.g. classifications, database or XML schemas and ontologies, matching is an operator which identifies those nodes in the two structures which semantically correspond to one another."@en .
@prefix skos:	<http://www.w3.org/2004/02/skos/core#> .
dbpedia:Semantic_matching	skos:subject	<http://dbpedia.org/resource/Category:Ontology_%28computer_science%29> .
@prefix ns6:	<http://dbpedia.org/resource/Category:> .
dbpedia:Semantic_matching	skos:subject	ns6:Semantic_Web .