Matches in ScholarlyData for { ?s ?p ?o. }
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent james-p-mccusker.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent deborah-mcguinness.
- item-4 next item-5.
- item-4 previous item-3.
- item-5 type ListItem.
- item-5 hasContent henry-s-thompson.
- item-5 previous item-4.
- 274 creator bernardo-cuenca-grau.
- 274 creator giorgos-stoilos.
- 274 creator ian-horrocks.
- 274 type InProceedings.
- 274 label "Completeness Guarantees for Incomplete Reasoners".
- 274 sameAs 274.
- 274 abstract "We extend our recent work on evaluating incomplete reasoners by introducing strict testing bases. We show how they can be used in practice to identify ontologies and queries where applications can exploit highly scalable incomplete query answering systems while enjoying completeness guarantees normally available only when using computationally intensive reasoning systems.".
- 274 hasAuthorList authorList.
- 274 isPartOf proceedings.
- 274 keyword "semantic web".
- 274 title "Completeness Guarantees for Incomplete Reasoners".
- 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 giorgos-stoilos.
- 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.
- 278 creator alexandra-poulovassilis.
- 278 creator peter-wood.
- 278 type InProceedings.
- 278 label "Combining Approximation and Relaxation in SemanticWeb Path Queries".
- 278 sameAs 278.
- 278 abstract "We develop query relaxation techniques for regular path queries and combine them with query approximation in order to support flexible querying of RDF data when the user lacks knowledge of its full structure or where the structure is irregular. In such circumstances, it is helpful if the querying system can perform both approximate matching and relaxation of the user's query and can rank the answers according to how closely they match the original query. Our framework incorporates both standard notions of approximation based on edit distance and RDFS-based inference rules. The query language we adopt comprises conjunctions of regular path queries, thus including extensions proposed for SPARQL to allow for querying paths using regular expressions. We provide an incremental query evaluation algorithm which runs in polynomial time and returns answers to the user in ranked order.".
- 278 hasAuthorList authorList.
- 278 isPartOf proceedings.
- 278 keyword "semantic web".
- 278 title "Combining Approximation and Relaxation in SemanticWeb Path Queries".
- 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 alexandra-poulovassilis.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent peter-wood.
- item-2 previous item-1.
- 280 creator birte-glimm.
- 280 creator markus-kroetzsch.
- 280 type InProceedings.
- 280 label "SPARQL Beyond Subgraph Matching".
- 280 sameAs 280.
- 280 abstract "We extend the Semantic Web query language SPARQL by defining the semantics of SPARQL queries under the entailment regimes of RDF, RDFS, and OWL. The proposed extensions are part of the SPARQL 1.1 Entailment Regimes working draft which is currently being developed as part of the W3C standardization process of SPARQL 1.1. We review the conditions that SPARQL imposes on such extensions, discuss the practical difficulties of this task, and explicate the design choices underlying our proposals. In addition, we include an overview of current implementations and their underlying techniques.".
- 280 hasAuthorList authorList.
- 280 isPartOf proceedings.
- 280 keyword "semantic web".
- 280 title "SPARQL Beyond Subgraph Matching".
- 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 birte-glimm.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent markus-kroetzsch.
- item-2 previous item-1.
- 288 creator birte-glimm.
- 288 creator boris-motik.
- 288 creator giorgos-stoilos.
- 288 creator ian-horrocks.
- 288 type InProceedings.
- 288 label "Optimising Ontology Classification".
- 288 sameAs 288.
- 288 abstract "Ontology classification - the computation of subsumption hierarchies for classes and properties is one of the most important tasks for OWL reasoners. Based on the algorithm by Shearer and Horrocks [9], we present a new classification procedure that addresses several open issues of the original algorithm, and that uses several novel optimisations in order to achieve superior performance. We also consider the classification of (object and data) properties. We show that algorithms commonly used to implement that task are incomplete even for relatively weak ontology languages. Furthermore, we show how to reduce the property classification problem into a standard (class) classification problem, which allows reasoners to classify properties using our optimised procedure. We have implemented our algorithms in the OWL HermiT reasoner, and we present the results of a performance evaluation.".
- 288 hasAuthorList authorList.
- 288 isPartOf proceedings.
- 288 keyword "semantic web".
- 288 title "Optimising Ontology Classification".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasItem item-3.
- authorList hasItem item-4.