Changes between Version 2 and Version 3 of SD2011-research-session

Timestamp:

05/19/11 17:54:48 (13 years ago)

Author:

titiroman (IP: 82.144.161.228)

Comment:

--

SD2011-research-session

@@ -4 +4 @@
 
 Organized by Dumitru Roman, SINTEF, Norway[[BR]]Target audience: Researchers,  engineers, and students
+
+
+!08:30 - !09:00 ''The Datalift Project: Ontologies, Datasets, Tools and Methodologies to Publish and Interlink Datasets'' by François Scharffe
+
+ * Abstract: Publishing linked data can be as simple as installing a tool on a server in a few clicks. However, publishing quality linked data is another story. Ontologies need to be carefully selected and designed, reference datasets need to be identified and the corresponding resources linked to the new dataset. These tasks require both a considerable amount of effort, as well as the availability of reference ontologies and datasets to publish and link the data. The Datalift project proposes to tackle these issues on the example of publishing french public data. Datalift aims at developing a suite of tools easing the publication process, and to provide reference ontologies and datasets that can serve as authoritative datasets to which others can link. We will present the current progress toward reaching this goal, in particular we will focus on Linked Open Vocabularies, a tool for analysing vocabulary usage on the Web of data, and on techniques allowing to automate the data linking process. We will also show our progress towards building a French linked-data ecosystem.
+
 
 !08:30 - !09:00 ''An Overview of Norwegian Linked Open Data'' by David Norheim and Dumitru Roman
@@ -15 +21 @@
 
 
+
+!08:30 - !09:00 ''From Linked Data to Linked Rules'' by Harold Boley
+
+ * Abstract: Linked Data (including Linked Open Data and Linked Enterprise Data) have become a new focal point of Semantic Web R&D with potentially high impact on IT at large. Data typically come in the form of relational or graph databases (e.g., triple stores). Relational data can be viewed as ground (variable-free) facts of deductive databases, and facts are rules with an empty premise. Similarly, graph data can be viewed as ground frames of F-logic, RIF, PSOA RuleML, or N3, which can also be defined by rules. Therefore, a natural generalization of Linked Data is Linked Rules. Via bottom-up execution, Linked Rules permit the 'bulk' derivation of Linked Data sets, contexts, modules, or named graphs. Via top-down execution (querying), they permit 'selective' derivations on demand. The linking mechanism of Linked Data and Rules is IRIs (Internationalized Resource Identifiers), which can be used as OIDs (Object Identifiers) of frames, and also occur as slot fillers, slot keys, type identifiers, and document identifiers for modules. Linking between entire data and rule modules is the essence of Linked Data and Linked Rules.
+
+
 ....