Matches in ScholarlyData for { ?s ?p ?o. }
- authorList hasLastItem item-4.
- item-1 type ListItem.
- item-1 hasContent emilio-rubiera.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent luis-polo.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent diego-berrueta.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent adil-el-ghali.
- item-4 previous item-3.
- 249 creator anastasia-dimou.
- 249 creator charalampos-bratsas.
- 249 creator christoph-lange.
- 249 creator ioannis-antoniou.
- 249 creator michael-kohlhase.
- 249 creator patrick-ion.
- 249 creator wolfram-sperber.
- 249 type InProceedings.
- 249 label "Getting Mathematics Towards the Web of Data: the Case of the Mathematics Subject Classification".
- 249 sameAs 249.
- 249 abstract "The Mathematics Subject Classification (MSC), maintained by the American Mathematical Society’s Mathematical Reviews (MR) and FIZ Karlsruhe’s Zentralblatt für Mathematik (Zbl), is a scheme for classifying publications in mathematics according to their subjects. While it is widely used, its traditional, idiosyncratic conceptualization and representation requires custom implementations of search, query and annotation support. This did not encourage people to create and explore connections of mathematics to subjects of related domains (e.g. science), and it made the scheme hard to maintain. We have reimplemented the current version of MSC2010 as a Linked Open Dataset using SKOS and are turning it into the new MSC authority. This paper explains the motivation, and details our design considerations and how we realized them in the implementation. We present in-the-field use cases and show how to scale existing solutions to take full advantage of the now complete LOD set. We conclude with a roadmap for bootstrapping the presence of mathematical and mathematics-based science, technology, and engineering knowledge on the Web of Data, where it has been noticeably underrepresented so far, starting from MSC/SKOS as a seed. We point out how e-science applications can take advantage of that.".
- 249 hasAuthorList authorList.
- 249 isPartOf proceedings.
- 249 keyword "Digital Libraries".
- 249 keyword "Linked Open Data".
- 249 keyword "Mathematics".
- 249 keyword "SKOS".
- 249 keyword "Subject Classification Scheme".
- 249 title "Getting Mathematics Towards the Web of Data: the Case of the Mathematics Subject Classification".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- 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 hasLastItem item-7.
- item-1 type ListItem.
- item-1 hasContent christoph-lange.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent patrick-ion.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent anastasia-dimou.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent charalampos-bratsas.
- item-4 next item-5.
- item-4 previous item-3.
- item-5 type ListItem.
- item-5 hasContent wolfram-sperber.
- item-5 next item-6.
- item-5 previous item-4.
- item-6 type ListItem.
- item-6 hasContent michael-kohlhase.
- item-6 next item-7.
- item-6 previous item-5.
- item-7 type ListItem.
- item-7 hasContent ioannis-antoniou.
- item-7 previous item-6.
- 285 creator riccardo-rosati.
- 285 type InProceedings.
- 285 label "Prexto: Query Rewriting under Extensional Constraints in DL-Lite".
- 285 sameAs 285.
- 285 abstract "In this paper we present Prexto, an algorithm for comput- ing the perfect rewriting of unions of conjunctive queries over ontologies expressed in the description logic DL-LiteA. The main novelty of Prexto lies in the fact that it constitutes the ﰃrst technique for query rewriting over ontologies which fully exploits extensional constraints to optimize query rewriting. In addition, Prexto makes use of functional role axioms and of concept and role disjointness axioms to optimize the size of the rewritten query. We show that these optimizations allow Prexto to out- perform the existing query rewriting techniques for DL-Lite in practical cases.".
- 285 hasAuthorList authorList.
- 285 isPartOf proceedings.
- 285 keyword "DL Lite".
- 285 keyword "conjunctive queries".
- 285 keyword "query rewriting".
- 285 title "Prexto: Query Rewriting under Extensional Constraints in DL-Lite".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasLastItem item-1.
- item-1 type ListItem.
- item-1 hasContent riccardo-rosati.
- 31 creator olaf-hartig.
- 31 type InProceedings.
- 31 label "SPARQL for a Web of Linked Data: Semantics and Computability".
- 31 sameAs 31.
- 31 abstract "The World Wide Web currently evolves into a Web of Linked Data where content providers publish and link data as they have done with hypertext for the last 20 years. While the declarative query language SPARQL is the de facto for querying a-priory defined sets of data from the Web, no language exists for querying the Web of Linked Data itself. However, it seems natural to ask whether SPARQL is also suitable for such a purpose. In this paper we formally investigate the applicability of SPARQL as a query language for Linked Data on the Web. In particular, we study two query models: 1) a full-Web semantics where the scope of a query is the complete set of Linked Data on the Web and 2) a family of reachability-based semantics which restrict the scope to data that is reachable by traversing certain data links. For both models we discuss properties such as monotonicity and computability as well as the implications of querying a Web that is infinitely large due to data generating servers.".
- 31 hasAuthorList authorList.
- 31 isPartOf proceedings.
- 31 keyword "Linked Data".
- 31 keyword "SPARQL".
- 31 keyword "computability".
- 31 keyword "query semantics".
- 31 keyword "theory".
- 31 title "SPARQL for a Web of Linked Data: Semantics and Computability".