Matches in ScholarlyData for { ?s ?p ?o. }
- 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 vadim-ivanov.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent matthias-knorr.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent joao-leite.
- item-3 previous item-2.
- paper-15 type InProceedings.
- paper-15 label "Incremental Reasoning in OWL EL without Bookkeeping".
- paper-15 sameAs paper-15.
- paper-15 abstract "We describe a method for updating the classification of ontologies expressed in the E L family of Description Logics after some axioms have been added or deleted. While incremental classification modulo additions is relatively straightforward, handling deletions is more problematic since it requires retracting logical consequences that are no longer valid. Known algorithms address this problem using various forms of bookkeeping to trace the consequences back to premises. But such additional data can consume memory and place an extra burden on the reasoner during application of inferences. In this paper, we present a technique, which avoids this extra cost while being very efficient for small incremental changes in ontologies. The technique is freely available as a part of the open-source E L reasoner ELK and its efficiency is demonstrated on naturally occurring and synthetic data.".
- paper-15 hasAuthorList authorList.
- paper-15 isPartOf proceedings-1.
- paper-15 title "Incremental Reasoning in OWL EL without Bookkeeping".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasLastItem item-2.
- item-1 type ListItem.
- item-1 hasContent yevgeny-kazakov.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent pavel-klinov.
- item-2 previous item-1.
- paper-16 type InProceedings.
- paper-16 label "Secure Manipulation of Linked Data".
- paper-16 sameAs paper-16.
- paper-16 abstract "When it comes to publishing data on the web, the level of access control required (if any) is highly dependent on the type of content exposed. Up until now RDF data publishers have focused on exposing and linking public data. With the advent of SPARQL 1.1, the linked data infrastructure can be used, not only as a means of publishing open data but also, as a general mechanism for managing distributed graph data. However, such a decentralised architecture brings with it a number of additional challenges with respect to both data security and integrity. In this paper, we propose a general authorisation framework that can be used to deliver dynamic query results based on user credentials and to cater for the secure manipulation of linked data. Specifically we describe how graph patterns, propagation rules, conflict resolution policies and integrity constraints can together be used to specify and enforce consistent access control policies.".
- paper-16 hasAuthorList authorList.
- paper-16 isPartOf proceedings-1.
- paper-16 title "Secure Manipulation of Linked Data".
- 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 sabrina-kirrane.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent ahmed-abdelrahman.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent alessandra-mileo.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent stefan-decker.
- item-4 previous item-3.
- paper-17 type InProceedings.
- paper-17 label "A decision procedure for SHOIQ with transitive closure of roles".
- paper-17 sameAs paper-17.
- paper-17 abstract "The Semantic Web makes an extensive use of the OWL DL ontology language, underlied by the SHOIQ description logic, to formalize its resources. In this paper, we propose a decision procedure for this logic extended with the transitive closure of roles in concept axioms, a feature needed in several application domains. The most challenging issue we have to deal with when designing such a decision procedure is to represent infinitely non-tree-shaped models, which are different from those of SHOIQ ontologies. To address this issue, we introduce a new blocking condition for characterizing models which may have an infinite non-tree-shaped part.".
- paper-17 hasAuthorList authorList.
- paper-17 isPartOf proceedings-1.
- paper-17 title "A decision procedure for SHOIQ with transitive closure of roles".
- 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 chan-le-duc.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent myriam-lamolle.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent olivier-cure.
- item-3 previous item-2.
- paper-18 type InProceedings.
- paper-18 label "Elastic and scalable processing of Linked Stream Data in the Cloud".
- paper-18 sameAs paper-18.
- paper-18 abstract "Linked Stream Data extends the Linked Data paradigm to dynamic data sources. It enables the integration and joint processing of heterogeneous stream data with quasi-static data from the Linked Data Cloud in near-real-time. Several Linked Stream Data processing engines exist but their scalability still needs to be in improved in terms of (static and dynamic) data sizes, number of concurrent queries, stream update frequencies, etc. So far, none of them supports parallel processing in the Cloud, i.e., elastic load profiles in a hosted environment. To remedy these limitations, this paper presents an approach for elastically parallelizing the continuous execution of queries over Linked Stream Data. For this, we have developed novel, highly efficient, and scalable parallel algorithms for continuous query operators. Our approach and algorithms are implemented in our CQELS Cloud system and we present extensive evaluations of their superior performance on Amazon EC2 demonstrating their high scalability and excellent elasticity in a real deployment.".
- paper-18 hasAuthorList authorList.
- paper-18 isPartOf proceedings-1.
- paper-18 title "Elastic and scalable processing of Linked Stream Data in the Cloud".
- 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 danh-le-phuoc.