Tractable reasoning and efficient query answering in description logics: The DL-Lite family
From MaRDI portal
Publication:2462646
DOI10.1007/S10817-007-9078-XzbMATH Open1132.68725DBLPjournals/jar/CalvaneseGLLR07OpenAlexW2137862151WikidataQ62048055 ScholiaQ62048055MaRDI QIDQ2462646FDOQ2462646
Riccardo Rosati, Giuseppe De Giacomo, Domenico Lembo, Maurizio Lenzerini, Diego Calvanese
Publication date: 3 December 2007
Published in: Journal of Automated Reasoning (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.177.2073
Cites Work
- Tractable reasoning and efficient query answering in description logics: The DL-Lite family
- Title not available (Why is that?)
- Linking Data to Ontologies
- Testing containment of conjunctive queries under functional and inclusion dependencies
- Data complexity of query answering in description logics
- Title not available (Why is that?)
- Answer sets for consistent query answering in inconsistent databases
- An epistemic operator for description logics
- Recursive query plans for data integration
- On Instance-level Update and Erasure in Description Logic Ontologies
- Combining Horn rules and description logics in CARIN
- Data complexity of query answering in expressive description logics via tableaux
- Integrity constraints for XML
- Data Integration through ${\textit{DL-Lite}_{\mathcal A}}$ Ontologies
- Deduction in Concept Languages: from Subsumption to Instance Checking
Cited In (only showing first 100 items - show all)
- Complexity of Axiom Pinpointing in the DL-Lite Family of Description Logics
- Games for query inseparability of description logic knowledge bases
- Linking Data to Ontologies
- Rewriting Conjunctive Queries over Description Logic Knowledge Bases
- Reasoning and Query Answering in Description Logics
- Second-Order Quantifier Elimination on Relational Monadic Formulas – A Basic Method and Some Less Expected Applications
- Conceptual Modeling for Data Integration
- Forgetting for knowledge bases in DL-lite
- Logic-based ontology comparison and module extraction, with an application to DL-Lite
- Title not available (Why is that?)
- The price of query rewriting in ontology-based data access
- Tractable approximate deduction for OWL
- A Comparison of Reasoning Techniques for Querying Large Description Logic ABoxes
- View-based query answering in description logics: semantics and complexity
- The Complexity of Satisfiability for Fragments of Hybrid Logic—Part I
- Formal Properties of Modularisation
- Data Integration through ${\textit{DL-Lite}_{\mathcal A}}$ Ontologies
- Description Logics
- Datalog rewritability of disjunctive Datalog programs and non-Horn ontologies
- Tightly integrated probabilistic description logic programs for representing ontology mappings
- Tightly Integrated Probabilistic Description Logic Programs for Representing Ontology Mappings
- Decidability of Circumscribed Description Logics Revisited
- Modal definability of first-order formulas with free variables and query answering
- Top-\(k\) retrieval for ontology mediated access to relational databases
- Enhancing context knowledge repositories with justifiable exceptions
- Data complexity of query answering in expressive description logics via tableaux
- Ontology-Mediated Query Answering with Data-Tractable Description Logics
- Polynomial rewritings from expressive description logics with closed predicates to variants of Datalog
- Tractable query answering and rewriting under description logic constraints
- Knowledge base exchange: the case of OWL 2 QL
- DL-Lite Ontology Revision Based on An Alternative Semantic Characterization
- Conservative Retractions of Propositional Logic Theories by Means of Boolean Derivatives: Theoretical Foundations
- A description logic based situation calculus
- On rules with existential variables: walking the decidability line
- Circuit Complexity Meets Ontology-Based Data Access
- Bringing existential variables in answer set programming and bringing non-monotony in existential rules: two sides of the same coin
- Query answering with DBoxes is hard
- Assertional Removed Sets Merging of DL-Lite Knowledge Bases
- Data repair of inconsistent nonmonotonic description logic programs
- Tractable reasoning and efficient query answering in description logics: The DL-Lite family
- Inseparability and Conservative Extensions of Description Logic Ontologies: A Survey
- Semantic Reasoning with Uncertain Information from Unreliable Sources
- Logical foundations of information disclosure in ontology-based data integration
- Answering regular path queries in expressive description logics via alternating tree-automata
- Analyzing real-world SPARQL queries and ontology-based data access in the context of probabilistic data
- Logic-based argumentation with existential rules
- Ontologies and Databases: The DL-Lite Approach
- Inconsistency-Tolerant Query Answering: Rationality Properties and Computational Complexity Analysis
- A distance-based framework for inconsistency-tolerant reasoning and inconsistency measurement in DL-Lite
- Understanding the complexity of axiom pinpointing in lightweight description logics
- FLP answer set semantics without circular justifications for general logic programs
- Query Answering in the Description Logic Horn- $\mathcal{SHIQ}$
- Consequence-based and fixed-parameter tractable reasoning in description logics
- Certain answers as objects and knowledge
- Query answering DL-lite knowledge bases from hidden datasets
- Investigating the Mapping between Default Logic and Inconsistency-Tolerant Semantics
- Towards more expressive ontology languages: the query answering problem
- Foundations of instance level updates in expressive description logics
- Ontology-based semantic search on the web and its combination with the power of inductive reasoning
- Prioritized assertional-based removed sets revision of \textit{DL}-\textit{Lite} belief bases
- Quantitative Logic Reasoning
- Instance-Level Update in DL-Lite Ontologies through First-Order Rewriting
- Tightly Coupled Probabilistic Description Logic Programs for the Semantic Web
- On the complexity of propositional and relational credal networks
- Disjunctive datalog with existential quantifiers: Semantics, decidability, and complexity issues
- Selecting accepted assertions in partially ordered inconsistent DL-Lite knowledge bases
- Capturing model-based ontology evolution at the instance level: the case of DL-Lite
- Semantic query optimization in the presence of types
- The incredible ELK. From polynomial procedures to efficient reasoning with \(\mathcal {EL}\) ontologies
- Scalable Reasoning by Abstraction Beyond DL-Lite
- Title not available (Why is that?)
- Query inseparability for \(\mathcal{ALC}\) ontologies
- A Single Approach to Decide Chase Termination on Linear Existential Rules
- First-Order Rewritability and Complexity of Two-Dimensional Temporal Ontology-Mediated Queries
- Characterizing Boundedness in Chase Variants
- Inlining External Sources in Answer Set Programs
- ELIMINATING CONCEPTS AND ROLES FROM ONTOLOGIES IN EXPRESSIVE DESCRIPTIVE LOGICS
- Doctoral Consortium Extended Abstract: Default Mappings in Ontology-Based Data Access
- Datalog rewritability and data complexity of \(\mathcal{ALCHOIQ}\) with closed predicates
- Foundations of ontology-based data access under bag semantics
- On the Interaction of Existential Rules and Equality Constraints in Ontology Querying
- Controlled query evaluation in description logics through consistent query answering
- Optimal fixed-premise repairs of \(\mathcal{E}\mathcal{L}\) TBoxes
- First-order rewritability of ontology-mediated queries in linear temporal logic
- Metamodeling and metaquerying in \texttt{OWL 2 QL}
- Reasoning on with Defeasibility in ASP
- Negative Knowledge for Certain Query Answers
- Query Rewriting under Linear $$\mathcal {EL}$$ Knowledge Bases
- Deciding FO-rewritability of Regular Languages and Ontology-Mediated Queries in Linear Temporal Logic
- Title not available (Why is that?)
- Databases and artificial intelligence
- Reasoning with ontologies
- Semantic web
- A complete classification of the complexity and rewritability of ontology-mediated queries based on the description logic \(\mathcal{EL}\)
- Tailoring Temporal Description Logics for Reasoning over Temporal Conceptual Models
- A Cookbook for Temporal Conceptual Data Modelling with Description Logics
- A tetrachotomy of ontology-mediated queries with a covering axiom
- Foundations of Temporal Conceptual Data Models
- DL-Lite with Temporalised Concepts, Rigid Axioms and Roles
- Recent Advances in Datalog$$^\pm $$
Recommendations
This page was built for publication: Tractable reasoning and efficient query answering in description logics: The DL-Lite family
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2462646)
