Linking Data to Ontologies
From MaRDI portal
Publication:5445729
DOI10.1007/978-3-540-77688-8_5zbMath1132.68061OpenAlexW1482134990WikidataQ62048049 ScholiaQ62048049MaRDI QIDQ5445729
Domenico Lembo, Riccardo Rosati, Diego Calvanese, Antonella Poggi, Maurizio Lenzerini, Giuseppe De Giacomo
Publication date: 6 March 2008
Published in: Journal on Data Semantics X (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-77688-8_5
Logic in artificial intelligence (68T27) Knowledge representation (68T30) Information storage and retrieval of data (68P20)
Related Items
Inconsistency-tolerant query answering for existential rules ⋮ Interests diffusion in social networks ⋮ Combining event calculus and description logic reasoning via logic programming ⋮ Doctoral Consortium Extended Abstract: Default Mappings in Ontology-Based Data Access ⋮ On the Interaction of Existential Rules and Equality Constraints in Ontology Querying ⋮ Tailoring Temporal Description Logics for Reasoning over Temporal Conceptual Models ⋮ An argumentative approach for handling inconsistency in prioritized Datalog ± ontologies ⋮ Data repair of inconsistent nonmonotonic description logic programs ⋮ A tetrachotomy of ontology-mediated queries with a covering axiom ⋮ Circuit Complexity Meets Ontology-Based Data Access ⋮ Towards more expressive ontology languages: the query answering problem ⋮ Unnamed Item ⋮ Querying the Unary Negation Fragment with Regular Path Expressions. ⋮ Bounds in ontology-based data access via circuit complexity ⋮ Logic-based argumentation with existential rules ⋮ Expressivity and Complexity of MongoDB Queries ⋮ Capturing model-based ontology evolution at the instance level: the case of DL-Lite ⋮ A Cookbook for Temporal Conceptual Data Modelling with Description Logics ⋮ Ontology-based semantic search on the web and its combination with the power of inductive reasoning ⋮ Answer Counting under Guarded TGDs ⋮ The notion of abstraction in ontology-based data management ⋮ Logic-based ontology comparison and module extraction, with an application to DL-Lite ⋮ Polynomial combined first-order rewritings for linear and guarded existential rules ⋮ View-based query answering in description logics: semantics and complexity ⋮ Conjunctive query answering in the description logic \(\mathcal S \mathcal H\) using knots ⋮ Deciding FO-rewritability of Regular Languages and Ontology-Mediated Queries in Linear Temporal Logic ⋮ Saturation-based Boolean conjunctive query answering and rewriting for the guarded quantification fragments ⋮ A Tutorial on Query Answering and Reasoning over Probabilistic Knowledge Bases ⋮ Tightly integrated probabilistic description logic programs for representing ontology mappings ⋮ Deciding FO-definability of regular languages ⋮ Inseparability and Conservative Extensions of Description Logic Ontologies: A Survey ⋮ Ontology-Mediated Query Answering with Data-Tractable Description Logics ⋮ Logical foundations of information disclosure in ontology-based data integration ⋮ The price of query rewriting in ontology-based data access ⋮ Tractable reasoning and efficient query answering in description logics: The DL-Lite family ⋮ Prioritized assertional-based removed sets revision of \textit{DL}-\textit{Lite} belief bases ⋮ Reasoning and Query Answering in Description Logics ⋮ Datalog and Its Extensions for Semantic Web Databases ⋮ Some notes on declarative specification of semantic data integration task in a peer-to-peer agent system ⋮ Top-\(k\) retrieval for ontology mediated access to relational databases ⋮ Unnamed Item ⋮ Optimized Query Rewriting for OWL 2 QL ⋮ Query answering DL-lite knowledge bases from hidden datasets ⋮ Investigating the Mapping between Default Logic and Inconsistency-Tolerant Semantics ⋮ Conceptual Modeling for Data Integration ⋮ Ontologies and Databases: The DL-Lite Approach ⋮ Enhancing probabilistic model checking with ontologies ⋮ Inconsistency-Tolerant Query Answering: Rationality Properties and Computational Complexity Analysis ⋮ Instance-Level Update in DL-Lite Ontologies through First-Order Rewriting ⋮ Query inseparability for \(\mathcal{ALC}\) ontologies ⋮ Foundations of ontology-based data access under bag semantics ⋮ DL-Lite with Temporalised Concepts, Rigid Axioms and Roles ⋮ Data Integration through ${\textit{DL-Lite}_{\mathcal A}}$ Ontologies ⋮ Guarded Ontology-Mediated Queries ⋮ First-Order Rewritability and Complexity of Two-Dimensional Temporal Ontology-Mediated Queries ⋮ Games for query inseparability of description logic knowledge bases
Uses Software
Cites Work
- Data complexity of query answering in description logics
- Data complexity of query answering in expressive description logics via tableaux
- Tractable reasoning and efficient query answering in description logics: The DL-Lite family
- Partial evaluation in logic programming
- Deduction in Concept Languages: from Subsumption to Instance Checking
- Disjunctive logic programs with inheritance
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item