Matches in ScholarlyData for { ?s ?p ?o. }
- item-3 type ListItem.
- item-3 hasContent andreas-harth.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent steffen-stadtmueller.
- item-4 next item-5.
- item-4 previous item-3.
- item-5 type ListItem.
- item-5 hasContent andrea-maurino.
- item-5 previous item-4.
- paper-02 type InProceedings.
- paper-02 label "Rapidly Integrating Services into the Linked Data Cloud".
- paper-02 sameAs paper-02.
- paper-02 abstract "The amount of data available in the Linked Data cloud continues to grow. Yet, few services consume and produce linked data. There is recent work that allows a user to define a linked service from an online service, which includes the specifications for consuming and producing linked data, but building such models is time consuming and requires specialized knowledge of RDF and SPARQL. This paper presents a new approach that allows domain experts to rapidly create semantic models of services by demonstration in an interactive web-based interface. First, the user provides examples of the service request URLs. Then, the system automatically proposes a service model the user can refine interactively. Finally, the system saves a service specification using a new expressive vocabulary that includes lowering and lifting rules. This approach empowers end users to rapidly model existing services and immediately use them to consume and produce linked data.".
- paper-02 hasAuthorList authorList.
- paper-02 isPartOf proceedings-2.
- paper-02 title "Rapidly Integrating Services into the Linked Data 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 mohsen-taheriyan.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent craig-knoblock.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent pedro-szekely.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent jose-luis-ambite.
- item-4 previous item-3.
- paper-03 type InProceedings.
- paper-03 label "Link Discovery with Guaranteed Reduction Ratio in Affine Spaces with Minkowski Measures".
- paper-03 sameAs paper-03.
- paper-03 abstract "Time-efficient algorithms are essential to address the complex linking tasks that arise when trying to discover links on the Web of Data. Although several lossless approaches have been developed for this exact purpose, they do not offer theoretical guarantees with respect to their performance. In this paper, we address this drawback by presenting the first Link Discovery approach with theoretical quality guarantees. In particular, we prove that given an achievable reduction ratio r, our Link Discovery approach HR3 can achieve a reduction ratio r'<=r in a metric space where distances are measured by the means of a Minkowski metric of any order p >= 2. We compare HR3 and the HYPPO algorithm implemented in LIMES 0.5 with respect to the number of comparisons they carry out. In addition, we compare our approach with the algorithms implemented in the state-of-the-art frameworks LIMES 0.5 and SILK 2.5 with respect to runtime. We show that HR3 outperforms these previous approaches with respect to runtime in each of our four experimental setups.".
- paper-03 hasAuthorList authorList.
- paper-03 isPartOf proceedings-2.
- paper-03 title "Link Discovery with Guaranteed Reduction Ratio in Affine Spaces with Minkowski Measures".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasLastItem item-1.
- item-1 type ListItem.
- item-1 hasContent axel-cyrille-ngonga-ngomo.
- paper-04 type InProceedings.
- paper-04 label "The Not-So-Easy Task of Computing Class Subsumptions in OWL RL".
- paper-04 sameAs paper-04.
- paper-04 abstract "The lightweight ontology language OWL RL is used for reasoning with large amounts of data. To this end, the W3C standard provides a simple system of deduction rules, which operate directly on the RDF syntax of OWL. Several similar systems have been studied. However, these approaches are usually complete for instance retrieval only. This paper asks if and how such methods could also be used for computing entailed subclass relationships. Checking entailment for arbitrary OWL RL class subsumptions is co-NP-hard, but tractable rule-based reasoning is possible when restricting to subsumptions between atomic classes. Surprisingly, however, this cannot be achieved in any RDF-based rule system, i.e., the W3C calculus cannot be extended to compute all atomic class subsumptions. We identify syntactic restrictions to mitigate this problem, and propose a rule system that is sound and complete for many OWL RL ontologies.".
- paper-04 hasAuthorList authorList.
- paper-04 isPartOf proceedings-2.
- paper-04 title "The Not-So-Easy Task of Computing Class Subsumptions in OWL RL".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasLastItem item-1.
- item-1 type ListItem.
- item-1 hasContent markus-kroetzsch.
- paper-05 type InProceedings.
- paper-05 label "MORe: Modular Combination of OWL Reasoners for Ontology Classification".
- paper-05 sameAs paper-05.
- paper-05 abstract "Classification is a fundamental reasoning task in ontology design, and there is currently a wide range of reasoners highly optimised for classification of OWL 2 ontologies. There are also several reasoners that are complete for restricted fragments of OWL 2 , such as the OWL 2 EL profile. These reasoners are much more efficient than fully-fledged OWL 2 reasoners, but they are not complete for ontologies containing (even if just a few) axioms outside the relevant fragment. In this paper, we propose a novel classification technique that combines an OWL 2 reasoner and an efficient reasoner for a given fragment in such a way that the bulk of the workload is assigned to the latter. Reasoners are combined in a black-box modular manner, and the specifics of their implementation (and even of their reasoning technique) are irrelevant to our approach.".
- paper-05 hasAuthorList authorList.
- paper-05 isPartOf proceedings-2.
- paper-05 title "MORe: Modular Combination of OWL Reasoners for Ontology Classification".
- 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 ana-armas.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent bernardo-cuenca-grau.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent ian-horrocks.
- item-3 previous item-2.
- paper-06 type InProceedings.
- paper-06 label "Concept-Based Semantic Difference in Expressive Description Logics".
- paper-06 sameAs paper-06.
- paper-06 abstract "Detecting, much less understanding, the difference between two description logic based ontologies is challenging for ontology engineers due, in part, to the possibility of complex, non-local logic effects of axiom changes. First, it is often quite difficult to even determine which concepts have had their meaning altered by a change. Second, once a concept change is pinpointed, the problem of distinguishing whether the concept is directly or indirectly affected by a change has yet to be tackled. To address the first issue, various principled notions of ``semantic diff'' (based on deductive inseparability) have been proposed in the literature and shown to be computationally practical for the expressively restricted case of ELHr-terminologies. However, problems arise even for such limited logics as ALC: First, computation gets more difficult, becoming undecidable for logics such as SROIQ which underly the Web Ontology Language (OWL). Second, the presence of negation and disjunction make the standard semantic difference too sensitive to change: essentially, any logically effectual change always affects all terms in the ontology. In order to tackle these issues, we formulate the central notion of finding the minimal change set based on model inseparability, and present a method to differentiate changes which are specific to (thus directly affect) particular concept names. Subsequently we devise a series of computable approximations, and compare the variously approximated change sets over a series of versions of the NCI Thesaurus (NCIt).".
- paper-06 hasAuthorList authorList.
- paper-06 isPartOf proceedings-2.
- paper-06 title "Concept-Based Semantic Difference in Expressive Description Logics".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasItem item-3.