DOCSLIB.ORG

Web Open Standards for Linked Data and Knowledge Graphs As Enablers of EU Digital Sovereignty

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text

Load more

Web open standards for linked data and knowledge graphs as enablers of EU digital sovereignty Fabien Gandon, http://fabien.info PROFILE . Graduated Engineer INSA Applied Math, DEA/Master Image & Vision . PHD & HDR (Habilitation) in computer science . Research Director / Senior researcher, INRIA . Leader Wimmics (UCA, Inria, CNRS, I3S) on Campus Sophia Antipolis . Advisory Committee of W3C . Responsible research convention French Ministry of Culture – Inria . Vice-head of Science for Inria Sophia Antipolis DR/Professors: . Fabien GANDON, Inria, AI, KRR, Semantic Web, Social Web, K. Graphs . Nhan LE THANH, UCA, Logics, KR, Emotions, Workflows, K. Graphs . Peter SANDER, UCA, Web, Emotions . Andrea TETTAMANZI, UCA, AI, Logics, Evo, Learning, Agents, K. Graphs WIMMICS TEAM . Marco WINCKLER, UCA, Human-Computer Interaction, Web, K. Graphs CR/Assistant Professors: . Michel BUFFA, UCA, Web, Social Media, Web Audio, K. Graphs . Elena CABRIO, UCA, NLP, KR, Linguistics, Q&A, Text Mining, K. Graphs . Olivier CORBY, Inria, KR, AI, Sem. Web, Programming, K. Graphs . Catherine FARON-ZUCKER, UCA, KR, AI, Semantic Web, K. Graphs . Damien GRAUX, Inria, Linked Data, Sem. Web, Querying, K. Graphs . Serena VILLATA, CNRS, AI, Argumentation, Licenses, Rights, K. Graphs Research engineer: Franck MICHEL, CNRS, Linked Data, Integration, DB, K. Graphs External: . Andrei Ciortea (University of St. Gallen) Agents, WoT, Sem. Web, K. Graphs . Nicolas DELAFORGE (Mnemotix) Sem. Web, KM, Integration, K. Graphs . Alain GIBOIN, (Retired CR Inria), Interaction Design, KE, User & Task, K. Graphs . Freddy LECUE (Thales, Montreal) AI, Logics, Mining, Big Data, S. Web , K. Graphs OWL N-Quad TriG RDF XML RDFS N-Triple Turtle/N3 CSV-LD R2RML JSON LD GRDDL XML JSON LDP SPARQL SHACL RDFa Linked Data RDF HTML HTTP URI, IRI, URL, HTTP URI STANDARDS FOR DATA & KNOWLEDGE GRAPHS ON THE WEB (1/8) Web open standards World Wide Web Consortium an international community leading the Web to its full potential since 1994 i.e. building an open, interoperable Web that works for everyone, by developing freely available and open standards for it. In 2016, Tim Berners-Lee received the Turing Award for his invention of the Web . Over 430 Members org. around the world = . The not-for-profit organization’s staff of 50 supported by Membership dues World Wide Web Consortium . Over 12,000 developers worldwide . 38 working groups + 10 interest groups + 350 Business Groups and Community Groups . Hundreds of open technologies that power… browsers, smart phones, ebook readers, set top boxes, automobiles, search engines, social media, trillions of dollars of online commerce, and more than a billion Web sites xquery xslt xschema skos xslfo rdf sparql rdfs owl p3p xsignat. xbop xml:id xpath xpointer ns xml xbase canon. x dtxml xproc xfrag woff wscdl wsp wsdl xbl xkms xlink sml ttml smile soap webcgm svg awww pics png powder qa rif sec cont. sawsdl ets mathml mf omr m. ok emma geo api grddl xhtml rdfa inkml its cmwww ruby an. assx dom xform ddrsa xml eve. exi … css ra earl mwbp cc/pp aria wcag iri uaag atag … html uri http url examples of former or current members examples of standards for instance… (2/8) Web open standards for… distributed, interoperable hypermedia AN HYPERMEDIA linking everything… three components of the Web architecture 1. identification (URI) & address (URL) ex. http://www.inria.fr URL three components of the Web architecture 1. identification (URI) & address (URL) ex. http://www.inria.fr HTTP 2. communication / protocol (HTTP) GET /centre/sophia HTTP/1.1 address Host: www.inria.fr URL three components of the Web architecture 1. identification (URI) & address (URL) ex. http://www.inria.fr HTML communication HTTP WEB 2. communication / protocol (HTTP) GET /centre/sophia HTTP/1.1 reference address Host: www.inria.fr 3. representation language (HTML) URL Fabien works at <a href="http://inria.fr">Inria</a> [Tim Beners-Lee et al., 1994] 14 (3/8) Web open standards for… distributed, interoperable identifiers Universal Resource Locator / Indentifier HTML communication HTTP HTML communication HTTP WEB WEB reference address reference address URL URI identify what identify, exists on the on the web, what web exists http://my-site.fr http://animals.org/this-zebra • URI for Paris in DBpedia: http://dbpedia.org/resource/Paris • URI for name of Victor Hugo in the Library of Congress: http://id.loc.gov/authorities/names/n79091479 • The MUC18 protein at UniProt http://www.uniprot.org/uniprot/P43121 • Xavier Dolan in Wikidata https://www.wikidata.org/wiki/Special:EntityData/Q551861 • The book with doi:10.1007/3-540-45741-0_18 http://dx.doi.org/10.1007/3-540-45741-0_18 • URIs for everything e.g. identifying 1025 car configurations [François-Paul Servant et al. ESWC 2012] (4/8) Web open standards for… distributed, interoperable data RDF: a Web standard for knowledge graphs HTML communication HTTP RDF communication HTTP WEB WEB reference address reference address URI URI a Web approach to data publication « http://fr.dbpedia.org/resource/Paris » ???... a Web approach to data publication HTTP URI GET a Web approach to data publication HTTP URI GET HTML, … a Web approach to data publication HTTP URI GET RDF linked data The MUC18 protein at UniProt http://www.uniprot.org/uniprot/P43121 linked open data(sets) cloud on the Web 1400 number of linked open datasets on the Web 1200 1000 800 600 400 200 0 5/1/2007 10/8/2007 11/7/2007 11/10/2007 2/28/2008 3/31/2008 9/18/2008 3/5/2009 3/27/2009 7/14/2009 9/22/2010 9/19/2011 8/30/2014 1/26/2017 Smarter Cities’ knowledge graphs IBM Dublin [Lécué et al., 2015] (also for private KGs behind firewalls) (5/8) Web open standards for… distributed interoperable access SPARQL : Get Data, Not Documents ex. DBpedia 31 185 377 686 RDF triples extracted and mapped DBPEDIA.FR 180 000 000 arcs in an encyclopedic knowledge public dumps, endpoints, interfaces, APIs… graph 2.5 millions max 70 000 on average number of queries per day COVID LINKED DATA [Gandon, Michel, Gazzotti, Mayer, Cabrio, Corby, Menin, Winckler, Villata et al. 2020] . integrate multiple datasets in heterogeneous formats . perform information extraction, inferences, validation . provide a public end-point and visualization services (6/8) Web open standards for… distributed interoperable validation SHACL is a language for describing and validating pieces (shapes) of RDF knowledge graphs eg. every Person must have one and only one name used for validation, description, interaction, integration, code generation,… [Corby et al., 2019] ONTOLOGY FOR AI ITSELF This project has received funding from the European Union's Horizon 2020 research and innovation programme under grant agreement 825619. ontology and metadata of AI resources . SHACL to validate AI4EU these RDF graphs . online endpoint http://corese.inria.fr . predefined SPARQL queries, SHACL shapes, display (7/8) Web open standards for… distributed, interoperable vocabularies RDFS to declare classes of resources and properties, of your knowledge graph and organize their hierarchy Document creator author Report Document Person OWL in one… union disjunction algebraic properties intersection complement ! restriction 1..1 disjoint properties cardinality ! qualified cardinality equivalence 1..1 enumeration individual prop. neg [>18] value restriction chained prop. disjoint union keys … Sexe Date Cause CISP2 ... History Observations Element Number H 25/04/2012 vaccin-antitétanique A44 ... Appendicite EN CP - Bon état général - auscult Patients 55 823 pulm libre; bdc rég sans souffle - Consultations 364 684 tympans ok- Past medical history 187 290 Biometric data 293 908 PRIMEGE Semiotics 250 669 Diagnosis 117 442 Row of prescribed drugs 847 422 Symptoms 23 488 Health care procedures 11 850 Additional examination 871 590 Paramedical prescription 17 222 PREDICT HOSPITALIZATION Observations/notes 56 143 [Gazzotti, Faron et al. 2020] . Predict hospitalization from Physician’s records classification Sexe Date Cause CISP2 ... History Observations Element Number H 25/04/2012 vaccin-antitétanique A44 ... Appendicite EN CP - Bon état général - auscult Patients 55 823 pulm libre; bdc rég sans souffle - Consultations 364 684 tympans ok- Past medical history 187 290 Biometric data 293 908 PRIMEGE Semiotics 250 669 Diagnosis 117 442 Row of prescribed drugs 847 422 Symptoms 23 488 Health care procedures 11 850 Additional examination 871 590 Paramedical prescription 17 222 Observations/notes 56 143 PREDICT HOSPITALIZATION (1) [Gazzotti, Faron et al. 2020] . Predict hospitalization from Physician’s records classification . Augment records data with Web knowledge graphs Sexe Date Cause CISP2 ... History Observations Element Number H 25/04/2012 vaccin-antitétanique A44 ... Appendicite EN CP - Bon état général - auscult Patients 55 823 pulm libre; bdc rég sans souffle - Consultations 364 684 tympans ok- Past medical history 187 290 Biometric data 293 908 PRIMEGE Semiotics 250 669 Diagnosis 117 442 Row of prescribed drugs 847 422 Symptoms 23 488 Health care procedures 11 850 Additional examination 871 590 Paramedical prescription 17 222 Observations/notes 56 143 PREDICT HOSPITALIZATION (1) [Gazzotti, Faron et al. 2020] . Predict hospitalization from Physician’s records classification . Augment records data with Web knowledge graphs (2) . Study impact on prediction broaderTransitive skos:narrowerTransitive broaderTransitive broaderTransitive skos:narrower broader broader SKOS #Mathematics #Algebra #LinearAlgebra thesaurus, lexicon narrower narrower skos:broaderTransitive narrowerTransitive
Recommended publications
  • Toward the Discovery and Extraction of Money Laundering Evidence from Arbitrary Data Formats Using Combinatory Reductions

    Toward the Discovery and Extraction of Money Laundering Evidence from Arbitrary Data Formats Using Combinatory Reductions

    Toward the Discovery and Extraction of Money Laundering Evidence from Arbitrary Data Formats using Combinatory Reductions Alonza Mumford, Duminda Wijesekera George Mason University [email protected], [email protected] Abstract—The evidence of money laundering schemes exist undetected in the electronic files of banks and insurance firms scattered around the world. Intelligence and law enforcement analysts, impelled by the duty to discover connections to drug cartels and other participants in these criminal activities, require the information to be searchable and extractable from all types of data formats. In this overview paper, we articulate an approach — a capability that uses a data description language called Data Format Description Language (DFDL) extended with higher- order functions as a host language to XML Linking (XLink) and XML Pointer (XPointer) languages in order to link, discover and extract financial data fragments from raw-data stores not co- located with each other —see figure 1. The strength of the ap- Fig. 1. An illustration of an anti-money laundering application that connects proach is grounded in the specification of a declarative compiler to multiple data storage sites. In this case, the native data format at each site for our concrete language using a higher-order rewriting system differs, and a data description language extended with higher-order functions with binders called Combinatory Reduction Systems Extended and linking/pointing abstractions are used to extract data fragments based on (CRSX). By leveraging CRSX, we anticipate formal operational their ontological meaning. semantics of our language and significant optimization of the compiler. Index Terms—Semantic Web, Data models, Functional pro- II.
  • O'reilly Xpath and Xpointer.Pdf

    O'reilly Xpath and Xpointer.Pdf

    XPath and XPointer John E. Simpson Publisher: O'Reilly First Edition August 2002 ISBN: 0-596-00291-2, 224 pages Referring to specific information inside an XML document is a little like finding a needle in a haystack. XPath and XPointer are two closely related Table of Contents languages that play a key role in XML processing by allowing developers Index to find these needles and manipulate embedded information. By the time Full Description you've finished XPath and XPointer, you'll know how to construct a full Reviews XPointer (one that uses an XPath location path to address document Reader reviews content) and completely understand both the XPath and XPointer features it Errata uses. 1 Table of Content Table of Content ............................................................................................................. 2 Preface............................................................................................................................. 4 Who Should Read This Book?.................................................................................... 4 Who Should Not Read This Book?............................................................................. 4 Organization of the Book............................................................................................ 5 Conventions Used in This Book ................................................................................. 5 Comments and Questions ........................................................................................... 6 Acknowledgments......................................................................................................
  • Annotea: an Open RDF Infrastructure for Shared Web Annotations

    Annotea: an Open RDF Infrastructure for Shared Web Annotations

    Proceedings of the WWW 10th International Conference, Hong Kong, May 2001. Annotea: An Open RDF Infrastructure for Shared Web Annotations Jos´eKahan,1 Marja-Riitta Koivunen,2 Eric Prud’Hommeaux2 and Ralph R. Swick2 1 W3C INRIA Rhone-Alpes 2 W3C MIT Laboratory for Computer Science {kahan, marja, eric, swick}@w3.org Abstract. Annotea is a Web-based shared annotation system based on a general-purpose open RDF infrastructure, where annotations are modeled as a class of metadata.Annotations are viewed as statements made by an author about a Web doc- ument. Annotations are external to the documents and can be stored in one or more annotation servers.One of the goals of this project has been to re-use as much existing W3C technol- ogy as possible. We have reacheditmostlybycombining RDF with XPointer, XLink, and HTTP. We have also implemented an instance of our system using the Amaya editor/browser and ageneric RDF database, accessible through an Apache HTTP server. In this implementation, the merging of annotations with documents takes place within the client. The paper presents the overall design of Annotea and describes some of the issues we have faced and how we have solved them. 1Introduction One of the basic milestones in the road to a Semantic Web [22] is the as- sociation of metadata to content. Metadata allows the Web to describe properties about some given content, even if the medium of this content does not directly provide the necessary means to do so. For example, ametadata schema for digital photos [15] allows the Web to describe, among other properties, the camera model used to take a photo, shut- ter speed, date, and location.
  • V a Lida T in G R D F Da

    V a Lida T in G R D F Da

    Series ISSN: 2160-4711 LABRA GAYO • ET AL GAYO LABRA Series Editors: Ying Ding, Indiana University Paul Groth, Elsevier Labs Validating RDF Data Jose Emilio Labra Gayo, University of Oviedo Eric Prud’hommeaux, W3C/MIT and Micelio Iovka Boneva, University of Lille Dimitris Kontokostas, University of Leipzig VALIDATING RDF DATA This book describes two technologies for RDF validation: Shape Expressions (ShEx) and Shapes Constraint Language (SHACL), the rationales for their designs, a comparison of the two, and some example applications. RDF and Linked Data have broad applicability across many fields, from aircraft manufacturing to zoology. Requirements for detecting bad data differ across communities, fields, and tasks, but nearly all involve some form of data validation. This book introduces data validation and describes its practical use in day-to-day data exchange. The Semantic Web offers a bold, new take on how to organize, distribute, index, and share data. Using Web addresses (URIs) as identifiers for data elements enables the construction of distributed databases on a global scale. Like the Web, the Semantic Web is heralded as an information revolution, and also like the Web, it is encumbered by data quality issues. The quality of Semantic Web data is compromised by the lack of resources for data curation, for maintenance, and for developing globally applicable data models. At the enterprise scale, these problems have conventional solutions. Master data management provides an enterprise-wide vocabulary, while constraint languages capture and enforce data structures. Filling a need long recognized by Semantic Web users, shapes languages provide models and vocabularies for expressing such structural constraints.
  • Semantics Developer's Guide

    Semantics Developer's Guide

    MarkLogic Server Semantic Graph Developer’s Guide 2 MarkLogic 10 May, 2019 Last Revised: 10.0-8, October, 2021 Copyright © 2021 MarkLogic Corporation. All rights reserved. MarkLogic Server MarkLogic 10—May, 2019 Semantic Graph Developer’s Guide—Page 2 MarkLogic Server Table of Contents Table of Contents Semantic Graph Developer’s Guide 1.0 Introduction to Semantic Graphs in MarkLogic ..........................................11 1.1 Terminology ..........................................................................................................12 1.2 Linked Open Data .................................................................................................13 1.3 RDF Implementation in MarkLogic .....................................................................14 1.3.1 Using RDF in MarkLogic .........................................................................15 1.3.1.1 Storing RDF Triples in MarkLogic ...........................................17 1.3.1.2 Querying Triples .......................................................................18 1.3.2 RDF Data Model .......................................................................................20 1.3.3 Blank Node Identifiers ..............................................................................21 1.3.4 RDF Datatypes ..........................................................................................21 1.3.5 IRIs and Prefixes .......................................................................................22 1.3.5.1 IRIs ............................................................................................22
  • Deciding SHACL Shape Containment Through Description Logics Reasoning

    Deciding SHACL Shape Containment Through Description Logics Reasoning

    Deciding SHACL Shape Containment through Description Logics Reasoning Martin Leinberger1, Philipp Seifer2, Tjitze Rienstra1, Ralf Lämmel2, and Steffen Staab3;4 1 Inst. for Web Science and Technologies, University of Koblenz-Landau, Germany 2 The Software Languages Team, University of Koblenz-Landau, Germany 3 Institute for Parallel and Distributed Systems, University of Stuttgart, Germany 4 Web and Internet Science Research Group, University of Southampton, England Abstract. The Shapes Constraint Language (SHACL) allows for for- malizing constraints over RDF data graphs. A shape groups a set of constraints that may be fulfilled by nodes in the RDF graph. We investi- gate the problem of containment between SHACL shapes. One shape is contained in a second shape if every graph node meeting the constraints of the first shape also meets the constraints of the second. Todecide shape containment, we map SHACL shape graphs into description logic axioms such that shape containment can be answered by description logic reasoning. We identify several, increasingly tight syntactic restrictions of SHACL for which this approach becomes sound and complete. 1 Introduction RDF has been designed as a flexible, semi-structured data format. To ensure data quality and to allow for restricting its large flexibility in specific domains, the W3C has standardized the Shapes Constraint Language (SHACL)5. A set of SHACL shapes are represented in a shape graph. A shape graph represents constraints that only a subset of all possible RDF data graphs conform to. A SHACL processor may validate whether a given RDF data graph conforms to a given SHACL shape graph. A shape graph and a data graph that act as a running example are pre- sented in Fig.
  • Improving E-Learning Environments for Pen and Multi-Touch Based Interaction a Study Case on Blog Tools and Mobile Devices

    Improving E-Learning Environments for Pen and Multi-Touch Based Interaction a Study Case on Blog Tools and Mobile Devices

    eLmL 2014 : The Sixth International Conference on Mobile, Hybrid, and On-line Learning Improving e-Learning Environments for Pen and Multi-touch Based Interaction A study case on blog tools and mobile devices André Constantino da Silva Heloísa Vieira da Rocha Institute of Computing (PG) Institute of Computing, NIED UNICAMP, IFSP UNICAMP Campinas, Brazil, Hortolândia, Brazil Campinas, Brazil [email protected] [email protected] Abstract — e-Learning environments are applications that use power to process Web pages. So, it is possible to access blog the Web infra-structure to support teaching and learning tools, read the messages, post new messages and write activities; they are designed to have good usability using a comments through mobile devices. But, it is important to desktop computer with keyboard, mouse and high resolution consider that these tools (and so their Web pages) are medium-size display. Devices equipped with pen and touch developed to be accessed by desktop computers equipped sensitive screen have enough computational power to render with keyboard, mouse and a medium size display; in your Web pages and allow users to navigate through the e-learning previous work we described that when a user interface environments. But, pen-based or touch sensitive devices have a designed for a set of interaction styles is accessed by a different input style; decreasing the usability of e-learning different set of interaction styles the users face interaction environments due the interaction modality change. To work on problems [5]. Another problem is that it is not possible to mobile contexts, e-learning environments must be improved to consider the interaction through pen and touch.
  • Rdfa in XHTML: Syntax and Processing Rdfa in XHTML: Syntax and Processing

    Rdfa in XHTML: Syntax and Processing Rdfa in XHTML: Syntax and Processing

    RDFa in XHTML: Syntax and Processing RDFa in XHTML: Syntax and Processing RDFa in XHTML: Syntax and Processing A collection of attributes and processing rules for extending XHTML to support RDF W3C Recommendation 14 October 2008 This version: http://www.w3.org/TR/2008/REC-rdfa-syntax-20081014 Latest version: http://www.w3.org/TR/rdfa-syntax Previous version: http://www.w3.org/TR/2008/PR-rdfa-syntax-20080904 Diff from previous version: rdfa-syntax-diff.html Editors: Ben Adida, Creative Commons [email protected] Mark Birbeck, webBackplane [email protected] Shane McCarron, Applied Testing and Technology, Inc. [email protected] Steven Pemberton, CWI Please refer to the errata for this document, which may include some normative corrections. This document is also available in these non-normative formats: PostScript version, PDF version, ZIP archive, and Gzip’d TAR archive. The English version of this specification is the only normative version. Non-normative translations may also be available. Copyright © 2007-2008 W3C® (MIT, ERCIM, Keio), All Rights Reserved. W3C liability, trademark and document use rules apply. Abstract The current Web is primarily made up of an enormous number of documents that have been created using HTML. These documents contain significant amounts of structured data, which is largely unavailable to tools and applications. When publishers can express this data more completely, and when tools can read it, a new world of user functionality becomes available, letting users transfer structured data between applications and web sites, and allowing browsing applications to improve the user experience: an event on a web page can be directly imported - 1 - How to Read this Document RDFa in XHTML: Syntax and Processing into a user’s desktop calendar; a license on a document can be detected so that users can be informed of their rights automatically; a photo’s creator, camera setting information, resolution, location and topic can be published as easily as the original photo itself, enabling structured search and sharing.
  • Using Rule-Based Reasoning for RDF Validation

    Using Rule-Based Reasoning for RDF Validation

    Using Rule-Based Reasoning for RDF Validation Dörthe Arndt, Ben De Meester, Anastasia Dimou, Ruben Verborgh, and Erik Mannens Ghent University - imec - IDLab Sint-Pietersnieuwstraat 41, B-9000 Ghent, Belgium [email protected] Abstract. The success of the Semantic Web highly depends on its in- gredients. If we want to fully realize the vision of a machine-readable Web, it is crucial that Linked Data are actually useful for machines con- suming them. On this background it is not surprising that (Linked) Data validation is an ongoing research topic in the community. However, most approaches so far either do not consider reasoning, and thereby miss the chance of detecting implicit constraint violations, or they base them- selves on a combination of dierent formalisms, eg Description Logics combined with SPARQL. In this paper, we propose using Rule-Based Web Logics for RDF validation focusing on the concepts needed to sup- port the most common validation constraints, such as Scoped Negation As Failure (SNAF), and the predicates dened in the Rule Interchange Format (RIF). We prove the feasibility of the approach by providing an implementation in Notation3 Logic. As such, we show that rule logic can cover both validation and reasoning if it is expressive enough. Keywords: N3, RDF Validation, Rule-Based Reasoning 1 Introduction The amount of publicly available Linked Open Data (LOD) sets is constantly growing1, however, the diversity of the data employed in applications is mostly very limited: only a handful of RDF data is used frequently [27]. One of the reasons for this is that the datasets' quality and consistency varies signicantly, ranging from expensively curated to relatively low quality data [33], and thus need to be validated carefully before use.
  • Bibliography of Erik Wilde

    Bibliography of Erik Wilde

    dretbiblio dretbiblio Erik Wilde's Bibliography References [1] AFIPS Fall Joint Computer Conference, San Francisco, California, December 1968. [2] Seventeenth IEEE Conference on Computer Communication Networks, Washington, D.C., 1978. [3] ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, Los Angeles, Cal- ifornia, March 1982. ACM Press. [4] First Conference on Computer-Supported Cooperative Work, 1986. [5] 1987 ACM Conference on Hypertext, Chapel Hill, North Carolina, November 1987. ACM Press. [6] 18th IEEE International Symposium on Fault-Tolerant Computing, Tokyo, Japan, 1988. IEEE Computer Society Press. [7] Conference on Computer-Supported Cooperative Work, Portland, Oregon, 1988. ACM Press. [8] Conference on Office Information Systems, Palo Alto, California, March 1988. [9] 1989 ACM Conference on Hypertext, Pittsburgh, Pennsylvania, November 1989. ACM Press. [10] UNIX | The Legend Evolves. Summer 1990 UKUUG Conference, Buntingford, UK, 1990. UKUUG. [11] Fourth ACM Symposium on User Interface Software and Technology, Hilton Head, South Carolina, November 1991. [12] GLOBECOM'91 Conference, Phoenix, Arizona, 1991. IEEE Computer Society Press. [13] IEEE INFOCOM '91 Conference on Computer Communications, Bal Harbour, Florida, 1991. IEEE Computer Society Press. [14] IEEE International Conference on Communications, Denver, Colorado, June 1991. [15] International Workshop on CSCW, Berlin, Germany, April 1991. [16] Third ACM Conference on Hypertext, San Antonio, Texas, December 1991. ACM Press. [17] 11th Symposium on Reliable Distributed Systems, Houston, Texas, 1992. IEEE Computer Society Press. [18] 3rd Joint European Networking Conference, Innsbruck, Austria, May 1992. [19] Fourth ACM Conference on Hypertext, Milano, Italy, November 1992. ACM Press. [20] GLOBECOM'92 Conference, Orlando, Florida, December 1992. IEEE Computer Society Press. http://github.com/dret/biblio (August 29, 2018) 1 dretbiblio [21] IEEE INFOCOM '92 Conference on Computer Communications, Florence, Italy, 1992.
  • Semantic Description of Web Services

    Semantic Description of Web Services

    Semantic Description of Web Services Thabet Slimani CS Department, Taif University, P.O.Box 888, 21974, KSA Abstract syntaxes) and in terms of the paradigms proposed for The tasks of semantic web service (discovery, selection, employing these in practice. composition, and execution) are supposed to enable seamless interoperation between systems, whereby human intervention is This paper is dedicated to provide an overview of these kept at a minimum. In the field of Web service description approaches, expressing their classification in terms of research, the exploitation of descriptions of services through commonalities and differences. It provides an semantics is a better support for the life-cycle of Web services. understanding of the technical foundation on which they The large number of developed ontologies, languages of are built. These techniques are classified from a range of representations, and integrated frameworks supporting the research areas including Top-down, Bottom-up and Restful discovery, composition and invocation of services is a good Approaches. indicator that research in the field of Semantic Web Services (SWS) has been considerably active. We provide in this paper a This paper does also provide some grounding that could detailed classification of the approaches and solutions, indicating help the reader perform a more detailed analysis of the their core characteristics and objectives required and provide different approaches which relies on the required indicators for the interested reader to follow up further insights objectives. We provide a little detailed comparison and details about these solutions and related software. between some approaches because this would require Keywords: SWS, SWS description, top-down approaches, addressing them from the perspective of some tasks bottom-up approaches, RESTful services.
  • Mapping Between Digital Identity Ontologies Through SISM

    Mapping Between Digital Identity Ontologies Through SISM

    Mapping between Digital Identity Ontologies through SISM Matthew Rowe The OAK Group, Department of Computer Science, University of Sheffield, Regent Court, 211 Portobello Street, Sheffield S1 4DP, UK [email protected] Abstract. Various ontologies are available defining the semantics of dig- ital identity information. Due to the rise in use of lowercase semantics, such ontologies are now used to add metadata to digital identity informa- tion within web pages. However concepts exist in these ontologies which are related and must be mapped together in order to enhance machine- readability of identity information on the web. This paper presents the Social identity Schema Mapping (SISM) vocabulary which contains a set of mappings between related concepts in distinct digital identity ontolo- gies using OWL and SKOS mapping constructs. Key words: Semantic Web, Social Web, SKOS, OWL, FOAF, SIOC, PIMO, NCO, Microformats 1 Introduction The semantic web provides a web of machine-readable data. Ontologies form a vital component of the semantic web by providing conceptualisations of domains of knowledge which can then be used to provide a common understanding of some domain. A basic ontology contains a vocabulary of concepts and definitions of the relationships between those concepts. An agent reading a concept from an ontology can look up the concept and discover its properties and characteristics, therefore interpreting how it fits into that particular domain. Due to the great number of ontologies it is common for related concepts to be defined in separate ontologies, these concepts must be identified and mapped together. Web technologies such as Microformats, eRDF and RDFa have allowed web developers to encode lowercase semantics within XHTML pages.