论文信息 - Defining Key Semantics for the Semantic Web : a Theoretical View

Defining Key Semantics for the Semantic Web : a Theoretical View

Many techniques were recently proposed to automate the linkage of RDF data sources on the Web. Predicate selection is the step of the linkage process that consists in selecting the smallest set of relevant predicates needed to enable instance comparison. We call keys this predicates set similar to the notion of keys in relational databases. We explore and explain formally the different assumptions behind various key semantics.

[1] Bernardo Cuenca Grau,et al. OWL 2 Web Ontology Language: Profiles , 2009 .

[2] Jérôme David,et al. Keys and Pseudo-Keys Detection for Web Datasets Cleansing and Interlinking , 2012, EKAW.

[3] Jeremy J. Carroll,et al. OWL 2 Web Ontology Language RDF-Based Semantics , 2009 .

[4] Boris Motik,et al. OWL 2 Web Ontology Language: structural specification and functional-style syntax , 2008 .

[5] Jürgen Umbrich,et al. Scalable and distributed methods for entity matching, consolidation and disambiguation over linked data corpora , 2012, J. Web Semant..

[6] Craig A. Knoblock,et al. Learning Blocking Schemes for Record Linkage , 2006, AAAI.

[7] Bernardo Cuenca Grau,et al. OWL 2 Web Ontology Language: Direct Semantics , 2009 .

[8] Jeff Heflin,et al. Automatically Generating Data Linkages Using a Domain-Independent Candidate Selection Approach , 2011, SEMWEB.

[9] Enrico Motta,et al. Data linking: capturing and utilising implicit schema-level relations , 2010, LDOW.

[10] Gerd Wagner,et al. Web Rules Need Two Kinds of Negation , 2003, PPSWR.