Ontologies and Databases: The DL-Lite Approach
From MaRDI portal
Publication:3639004
DOI10.1007/978-3-642-03754-2_7zbMath1254.68106OpenAlexW1528446492WikidataQ62048045 ScholiaQ62048045MaRDI QIDQ3639004
Riccardo Rosati, Giuseppe De Giacomo, Diego Calvanese, Antonella Poggi, Maurizio Lenzerini, Domenico Lembo, Mariano Rodriguez-Muro
Publication date: 28 October 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-03754-2_7
Related Items (11)
A complete classification of the complexity and rewritability of ontology-mediated queries based on the description logic \(\mathcal{EL}\) ⋮ Uncertain lightweight ontologies in a product-based possibility theory framework ⋮ Capturing model-based ontology evolution at the instance level: the case of DL-Lite ⋮ The notion of abstraction in ontology-based data management ⋮ Ontology-Mediated Query Answering with Data-Tractable Description Logics ⋮ Metamodeling and metaquerying in \texttt{OWL 2 QL} ⋮ Unnamed Item ⋮ Instance-Level Update in DL-Lite Ontologies through First-Order Rewriting ⋮ Foundations of ontology-based data access under bag semantics ⋮ Data Integration through ${\textit{DL-Lite}_{\mathcal A}}$ Ontologies ⋮ Absorption for ABoxes
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Data complexity of query answering in description logics
- Attributive concept descriptions with complements
- Data complexity of query answering in expressive description logics via tableaux
- Testing containment of conjunctive queries under functional and inclusion dependencies
- Automata-theoretic techniques for modal logics of programs
- Computational complexity of terminological reasoning in BACK
- The complexity of concept languages
- Conjunctive-query containment and constraint satisfaction
- Reasoning on UML class diagrams
- Tractable reasoning and efficient query answering in description logics: The DL-Lite family
- A tableau decision procedure for \(\mathcal{SHOIQ}\)
- Theory of computation.
- On Instance-level Update and Erasure in Description Logic Ontologies
- Polynomial-time implication problems for unary inclusion dependencies
- Data Complexity in the $\mathcal{EL}$ Family of Description Logics
- Towards Top-k Query Answering in Description Logics: The Case of DL-Lite
- Undirected connectivity in log-space
- The DL-Lite Family and Relations
- A description logic with transitive and inverse roles and role hierarchies
- Deduction in Concept Languages: from Subsumption to Instance Checking
- Linking Data to Ontologies
- Data Integration through ${\textit{DL-Lite}_{\mathcal A}}$ Ontologies
- An overview of tableau algorithms for description logics
- Answering queries using views: A survey
This page was built for publication: Ontologies and Databases: The DL-Lite Approach
