Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 12 of 12 for “"Ontology based data access"”.

  1. Database techniques for ontology-based data access

    Ontology-based Data Acess (OBDA) is a method for linking an ontology, which encodes knowledge about the classes and properties of entities for a given application domain,to underlying data sources. These data sources, managed by specialized systems, can be in various forms and usually reside in …

    greece Repository record for Database techniques for ontology-based data access (opens in a new tab)

  2. JOWSDATALOG: An Ontology Based Data Access Tool for Jointly-Weakly-Sticky Datalog± Programs

    Jointly-Weakly-Sticky(JWS) Datalog± is an expressive member of the family of Datalog± programs. It is characterized by a marking procedure, theexistential dependencygraph, and joint acyclicity. Query-answering (QA) can be done in polynomial-time in data complexity through SChQAS, a chase-based, …

    carleton Repository record for JOWSDATALOG: An Ontology Based Data Access Tool for Jointly-Weakly-Sticky Datalog± Programs (opens in a new tab)

  3. Efficient management for geospatial and temporal data using ontology-based data access techniques

    In this thesis, we propose an Ontology-based Data Access (OBDA) approach for accessing geospatial data stored in geospatial relational databases, using the OGC standard GeoSPARQL and R2RML or OBDA mappings. We introduce extensions to an existing SPARQL-to-SQL translation method to support GeoSPARQL …

    greece Repository record for Efficient management for geospatial and temporal data using ontology-based data access techniques (opens in a new tab)

  4. Using Ontology-Based Data Access to Enable Context Recognition in the Presence of Incomplete Information

    Ontology-based data access (OBDA) augments classical query answering in databases by including domain knowledge provided by an ontology. An ontology captures the terminology of an application domain and describes domain knowledge in a machine-processable way. Formal ontology languages additionally …

    qucosa-diss

  5. An integrated framework for comparing forward- and backward-chaining algorithms

    The fields of data integration/exchange (DI/DE) and Ontology-Based Data Access (OBDA) have been extensively studied across various communities, especially those of the database and the semantic web. The underlying problem is common: using several different structured data-sources mapped to a common …

    soton Download PDF for An integrated framework for comparing forward- and backward-chaining algorithms (opens in a new tab)

  6. Application of Definability to Query Answering over Knowledge Bases

    … (i.e. instance retrieval) is a central task in ontology based data access (OBDA). Performing this task involves reasoning with respect to a knowledge base K (i.e. ontology) over some description logic (DL) dialect L. As the expressive power of L grows, so does the complexity of reasoning with …

    waterloo Repository record for Application of Definability to Query Answering over Knowledge Bases (opens in a new tab)

  7. Semantic Modelling for Smart Batteries: A Common Language to Share Knowledge Between Battery Actors

    … resulted in increasingly complex and fragmented data environments. Battery-related data are often generated by different organisations, stored in a wide range of formats, and described using inconsistent terminology. This lack of standardisation creates significant challenges for integrating …

    southwales Repository record for Semantic Modelling for Smart Batteries: A Common Language to Share Knowledge Between Battery Actors (opens in a new tab) Download PDF for Semantic Modelling for Smart Batteries: A Common Language to Share Knowledge Between Battery Actors (opens in a new tab)

  8. Answering Object Queries over Knowledge Bases with Expressive Underlying Description Logics

    … The most straightforward and fundamental way to access information in these repositories is to search for objects that satisfy certain selection criteria. This work considers a description logics (DL) based representation of such information sources and object queries, which allows for automated …

    waterloo Repository record for Answering Object Queries over Knowledge Bases with Expressive Underlying Description Logics (opens in a new tab)

  9. Semantic Web Based Relational Database Access With Conflict Resolution

    This thesis focuses on (1) accessing relational databases through Semantic Web technologies and (2) resolving conflicts that usually arises when integrating data from heterogeneous source schemas and/or instances. In the first part of the thesis, we present an approach to access relational …

    wayne-thes Repository record for Semantic Web Based Relational Database Access With Conflict Resolution (opens in a new tab)

  10. Database-Inspired Reasoning Problems in Description Logics With Path Expressions

    … playing a central role in the Semantic Web, ontology-based information integration, or peer-to-peer data management. In such scenarios, an especially prominent role is played by description logics (DLs) – a robust family of logical formalisms used to describe ontologies and serving as the …

    qucosa-diss

  11. Semantic-guided predictive modeling and relational learning within industrial knowledge graphs

    The ubiquitous availability of data in today’s manufacturing environments, mainly driven by the extended usage of software and built-in sensing capabilities in automation systems, enables companies to embrace more advanced predictive modeling and analysis in order to optimize processes and usage of …

    lmu-germany Repository record for Semantic-guided predictive modeling and relational learning within industrial knowledge graphs (opens in a new tab)

  12. Αλγόριθμοι επανεγγραφής τροποποιημένων ερωτημάτων για βατές περιγραφικές λογικές

    … described in its TBox, such that for any ABox (dataset) the evaluation of the initial query over the TBox and the ABox can be computed by evaluating only the new query over the ABox. Because the computational complexity in expressive Description Logics is prohibitive tractable Description Logics …

    greece Repository record for Αλγόριθμοι επανεγγραφής τροποποιημένων ερωτημάτων για βατές περιγραφικές λογικές (opens in a new tab)