Personal tools
You are here: Home Users stoermer mynews Three OKKAM papers at AAAI Spring Symposium on Linked Data Meets AI

Three OKKAM papers at AAAI Spring Symposium on Linked Data Meets AI

by Heiko Stoermer last modified Dec 17, 2009 10:03 AM

The OKKAM team has three papers accepted at the AAAI Spring Symposium on Linked Data Meets AI

The AAAI 2010 Spring Symposium on Linked Data Meets AI (Stanford, 22-24 March 2010) aims at bringing together the researchers working on Linked Data and AI in the hope of creating a new community interested in utilizing AI techniques such as ontologies, machine learning, data fusion, etc. in exploring the linked open data.

Three papers were accepted from the OKKAM Consortium:

  1. G. Tummarello & R. Delbru: "Publishing Data thatLinks Itself: a Conjecture"
  2. S. Bocconi & A. Fogarolli: "Enriching a news portal with semantic information: an entity-based approach": In this paper we describe the production and consumption of linked data in the scenario of the Italian news agency ANSA portal. The goal of the use-case is to provide viewers of a news item with background information and links to related news articles contained on the portal. This information en- richment process is entity-based: ANSA news archive is ana- lyzed using Name Entity Recognition, and each detected en- tity is annotated with a unique identifier. These identifiers are obtained using the Entity Name Server developed within the scope of the OKKAM European project. Subsequently the news are published on the portal using RDFa and linked to Sig.ma, a semantic search engine that provide background information and links to additional news sources. The pre- sented project has the potential to contribute to Linked Data by creating and publishing a large quantity of entities and as- sertions about them coming from the ANSA news archive.
  3. P. Bouquet, C. Ghidini & L. Serafini: "A Formal Model of Queries on Interlinked RDF Graphs": In this paper, we propose a preliminary model of the web of data as a graph of interlinked graphs which goes beyond the standard single-graph RDF semantics, describe three different ways in which a query on this structure can be answered, and characterize semantically each of these ways in terms of three incremental restrictions on the relation between the domain of interpretation of each single component graph.

[Please note: links to pre-press PDFs currently accessible to OKKAM consortium members only]

Document Actions