Matches in ScholarlyData for { ?s ?p ?o. }
- authorList hasItem item-4.
- authorList hasLastItem item-4.
- item-1 type ListItem.
- item-1 hasContent idoia-berges.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent jesus-bermudez.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent alfredo-goni.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent arantza-illarramendi.
- item-4 previous item-3.
- 42 creator dimitris-andreou.
- 42 creator yannis-theoharis.
- 42 creator yannis-tzitzikas.
- 42 type InProceedings.
- 42 label "On Storage Policies for Semantic Web Repositories that Support Versioning".
- 42 sameAs 42.
- 42 abstract "This paper concerns versioning services over Semantic Web repositories. At first we introduce an abstract model of versioning services and subsequently we elaborate on storage policies for enabling these services. Specifically, we propose a novel storage policy that exploits the fact that RDF graphs have not a unique serialization (as it happens with texts). For this reason we introduce a storage structure for versioning that is based on partial orders. We discuss the comparative benefits and drawbacks of this approach in terms of storage space and efficiency both analytically and experimentally. For the latter case we report experimental results over large synthetic data sets and we provide efficient algorithms for version creation and retrieval.".
- 42 hasAuthorList authorList.
- 42 hasTopic Benchmark_%28computing%29.
- 42 hasTopic Scalability.
- 42 hasTopic Semantic_Web.
- 42 isPartOf proceedings.
- 42 keyword "sw data storage".
- 42 keyword "sw versioning".
- 42 title "On Storage Policies for Semantic Web Repositories that Support Versioning".
- 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 yannis-tzitzikas.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent yannis-theoharis.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent dimitris-andreou.
- item-3 previous item-2.
- 54 creator eero-hyvoenen.
- 54 creator jouni-tuominen.
- 54 creator katri-seppaelae.
- 54 creator kim-viljanen.
- 54 type InProceedings.
- 54 label "Building a National Semantic Web Ontology and Ontology Service Infrastructure----The FinnONTO Approach".
- 54 sameAs 54.
- 54 abstract "This article presents the vision and a framework for creating a national level ontology and ontology service infrastructure in Finland. Core parts of the system and ontologies have been implemented in a national project FinnONTO 2003-2007 funded by 37 companies and public organizations, and are being used it practice for creating semantic portals for eCulture, eHealth, eLearning, and eGovernment. The novelty of the FinnONTO infrastructure is based on two ideas. First, a system national of open source core ontologies is being developed by transforming thesauri in use into lightweight ontologies. The system is based an a large cross-domain top ontology, the General Finnish Ontology YSO, that is then extended by domain specific ontologies aligned with YSO and each other. Collaborative development of such a system of mutually aligned ontologies is supported for obtaining interoperability in their usage in applications. Second, the ONKI Ontology Server framework for publishing ontologies as ready to use services has been implemented. In contrast to earlier ontology servers, ONKI provides legacy and other applications with ready to use functionalities for using ontologies on the HTML level by Ajax and semantic widgets. The idea is to use ONKI for creating mash-up applications in a way analogous to using Google, Yahoo, or Nokia Maps, but in our case external applications are mashed-up with ontology support for, e.g, indexing content or semantic search using semantic autocompletion and disambiguation in a multi-lingual context.".
- 54 hasAuthorList authorList.
- 54 hasTopic Collaborative_software.
- 54 hasTopic Data_integration.
- 54 hasTopic Ontology_%28computer_science%29.
- 54 hasTopic Ontology_alignment.
- 54 hasTopic Semantic_Web.
- 54 hasTopic Semantic_Web_Services.
- 54 hasTopic Web_2.0.
- 54 hasTopic Web_Ontology_Language.
- 54 isPartOf proceedings.
- 54 keyword "application".
- 54 keyword "mash-up".
- 54 keyword "ontology mapping".
- 54 keyword "service".
- 54 keyword "thesauri".
- 54 title "Building a National Semantic Web Ontology and Ontology Service Infrastructure----The FinnONTO Approach".
- 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 eero-hyvoenen.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent kim-viljanen.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent jouni-tuominen.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent katri-seppaelae.
- item-4 previous item-3.
- 56 creator jeff-z-pan.
- 56 creator kewen-wang.
- 56 creator rodney-topor.
- 56 creator zhe-wang.
- 56 type InProceedings.
- 56 label "Restricting and forgetting in DL-Lite".
- 56 sameAs 56.
- 56 abstract "Description logics form the foundation of ontologies used in the Semantic Web. To support reuse and integration of ontologies in Semantic Web applications, it is often necessary to restrict ontologies to a subset of their concepts and roles, or equivalently to forget a complementary subset of concepts and roles from the ontologies. We present the first detailed account of this problem for description logics, in particular for the DL-Lite family of description logics. Specifically, we present a semantic definition of forgetting that generalises the standard definition for classical logic. We introduce algorithms for forgetting concepts roles from both DL-Lite TBoxes and ABoxes. We prove the algorithms are sound and complete with respect to the semantics, and demonstrate how they can be used to speed-up query answering in DL-Lite knowledge bases.".