Matches in ScholarlyData for { ?s ?p ?o. }
- paper-08 abstract "The ability to compute the differences that exist between two RDF/S Knowledge Bases (KBs) is important for aiding humans to understand the evolution of knowledge, and for reducing the amount of data that need to be exchanged and managed over the network in order to build synchronization, versioning and replication services. We will show how we can exploit blank node anonymity in order to reduce the delta size when comparing RDF/S KBs. We will show experimental results over real and synthetic data sets that demonstrate significant reductions of the sizes of the computed deltas, and how the reduced deltas can be visualized. (This demo paper accompanies a research paper accepted for ISWC'2012)".
- paper-08 hasAuthorList authorList.
- paper-08 isPartOf poster-demo-proceedings.
- paper-08 title "Demonstrating Blank Node Matching and RDF/S Comparison Functions".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasItem item-3.
- authorList hasLastItem item-3.
- item-1 type ListItem.
- item-1 hasContent christina-lantzaki.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent yannis-tzitzikas.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent dimitris-zeginis.
- item-3 previous item-2.
- paper-09 type InProceedings.
- paper-09 label "On Direct Debugging of Aligned Ontologies".
- paper-09 sameAs paper-09.
- paper-09 abstract "Modern ontology debugging methods allow efficient identification and localization of faulty axioms defined by a user while developing an ontology. However, in many use cases such as ontology alignment the ontologies might include many conflict sets, i.e. sets of axioms preserving the faults, thus making ontology diagnosis infeasible. In this paper we present a debugging approach based on a direct computation of diagnoses that omits calculation of conflict sets. Embedded in an ontology debugger, the proposed algorithm is able to identify diagnoses for an ontology which includes a large number of faults and for which application of standard diagnosis methods fails. The evaluation results show that the approach is practicable and is able to identify a fault in adequate time.".
- paper-09 hasAuthorList authorList.
- paper-09 isPartOf poster-demo-proceedings.
- paper-09 title "On Direct Debugging of Aligned Ontologies".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasItem item-3.
- authorList hasItem item-4.
- authorList hasLastItem item-4.
- item-1 type ListItem.
- item-1 hasContent kostyantyn-shchekotykhin.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent patrick-rodler.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent philipp-fleiss.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent gerhard-friedrich.
- item-4 previous item-3.
- paper-10 type InProceedings.
- paper-10 label "DiscOU: A Flexible Discovery Engine for Open Educational Resources Using Semantic Indexing and Relationship Summaries".
- paper-10 sameAs paper-10.
- paper-10 abstract "We demonstrate the DiscOU engine implementing a resource discovery approach where the textual components of open educational resources are automatically annotated with relevant entities (using a named entity recognition system), so that these rich annotations can be searched by similarity, based on existing resources of interest.".
- paper-10 hasAuthorList authorList.
- paper-10 isPartOf poster-demo-proceedings.
- paper-10 title "DiscOU: A Flexible Discovery Engine for Open Educational Resources Using Semantic Indexing and Relationship Summaries".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasItem item-3.
- authorList hasLastItem item-3.
- item-1 type ListItem.
- item-1 hasContent mathieu-daquin.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent carlo-allocca.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent trevor-collins.
- item-3 previous item-2.
- paper-11 type InProceedings.
- paper-11 label "Everything is Connected: Using Linked Data for Multimedia Narration of Connections between Concepts".
- paper-11 sameAs paper-11.
- paper-11 abstract "This paper introduces a Linked Data application for automatically generating a story between two concepts in the Web of Data, based on formally described links. A path between two concepts is obtained by querying multiple linked open datasets; the path is then enriched with multimedia presentation material for each node in order to obtain a full multimedia presentation of the found path.".
- paper-11 hasAuthorList authorList.
- paper-11 isPartOf poster-demo-proceedings.
- paper-11 title "Everything is Connected: Using Linked Data for Multimedia Narration of Connections between Concepts".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-10.
- authorList hasItem item-2.
- authorList hasItem item-3.
- authorList hasItem item-4.
- authorList hasItem item-5.
- authorList hasItem item-6.
- authorList hasItem item-7.
- authorList hasItem item-8.
- authorList hasItem item-9.
- authorList hasLastItem item-9.
- item-1 type ListItem.
- item-1 hasContent miel-vander-sande.
- item-1 next item-10.
- item-10 type ListItem.
- item-10 hasContent rik-van-de-walle.
- item-10 next item-2.
- item-10 previous item-1.
- item-2 type ListItem.
- item-2 hasContent ruben-verborgh.