Tractable reasoning and efficient query answering in description logics: The DL-Lite family
From MaRDI portal
Publication:2462646
DOI10.1007/s10817-007-9078-xzbMath1132.68725OpenAlexW2137862151WikidataQ62048055 ScholiaQ62048055MaRDI QIDQ2462646
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
Related Items
Optimal fixed-premise repairs of \(\mathcal{E}\mathcal{L}\) TBoxes, Reasoning on with Defeasibility in ASP, Selecting accepted assertions in partially ordered inconsistent DL-Lite knowledge bases, The notion of abstraction in ontology-based data management, On Horn Conjunctive Queries, Polynomial combined first-order rewritings for linear and guarded existential rules, Deciding FO-rewritability of Regular Languages and Ontology-Mediated Queries in Linear Temporal Logic, Designing efficient controlled languages for ontologies, First-Order Rewritability and Complexity of Two-Dimensional Temporal Ontology-Mediated Queries, DL-Lite Ontology Revision Based on An Alternative Semantic Characterization, Tractable approximate deduction for OWL, Datalog rewritability of disjunctive Datalog programs and non-Horn ontologies, 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, Knowledge base exchange: the case of OWL 2 QL, Certain answers as objects and knowledge, Second-Order Quantifier Elimination on Relational Monadic Formulas – A Basic Method and Some Less Expected Applications, Unnamed Item, A complete classification of the complexity and rewritability of ontology-mediated queries based on the description logic \(\mathcal{EL}\), Data repair of inconsistent nonmonotonic description logic programs, The Complexity of Satisfiability for Fragments of Hybrid Logic—Part I, ELIMINATING CONCEPTS AND ROLES FROM ONTOLOGIES IN EXPRESSIVE DESCRIPTIVE LOGICS, A tetrachotomy of ontology-mediated queries with a covering axiom, Bringing existential variables in answer set programming and bringing non-monotony in existential rules: two sides of the same coin, A universal approach to guarantee data privacy, Circuit Complexity Meets Ontology-Based Data Access, Towards more expressive ontology languages: the query answering problem, Semantic Reasoning with Uncertain Information from Unreliable Sources, Unnamed Item, A description logic based situation calculus, Forgetting for knowledge bases in DL-lite, Bounds in ontology-based data access via circuit complexity, Uncertain lightweight ontologies in a product-based possibility theory framework, Logic-based argumentation with existential rules, Analyzing real-world SPARQL queries and ontology-based data access in the context of probabilistic data, Capturing model-based ontology evolution at the instance level: the case of DL-Lite, Semantic query optimization in the presence of types, A distance-based framework for inconsistency-tolerant reasoning and inconsistency measurement in 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, Logic-based ontology comparison and module extraction, with an application to DL-Lite, View-based query answering in description logics: semantics and complexity, Foundations of instance level updates in expressive description logics, Tightly integrated probabilistic description logic programs for representing ontology mappings, Inseparability and Conservative Extensions of Description Logic Ontologies: A Survey, Inconsistency-Tolerant Querying of Description Logic Knowledge Bases, Recent Advances in Datalog$$^\pm $$, Ontology-Mediated Query Answering with Data-Tractable Description Logics, Logical foundations of information disclosure in ontology-based data integration, On rules with existential variables: walking the decidability line, Query Answering in the Description Logic Horn- $\mathcal{SHIQ}$, Modal definability of first-order formulas with free variables and query answering, FLP answer set semantics without circular justifications for general logic programs, The price of query rewriting in ontology-based data access, Assertional Removed Sets Merging of DL-Lite Knowledge Bases, Consequence-based and fixed-parameter tractable reasoning in description logics, Tractable reasoning and efficient query answering in description logics: The DL-Lite family, Quantitative Logic Reasoning, Data complexity of query answering in expressive description logics via tableaux, Metamodeling and metaquerying in \texttt{OWL 2 QL}, First-order rewritability of ontology-mediated queries in linear temporal logic, Generalized Satisfiability for the Description Logic $\mathcal{ALC}$, 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, OWL 2 Profiles: An Introduction to Lightweight Ontology Languages, Enhancing context knowledge repositories with justifiable exceptions, Disjunctive datalog with existential quantifiers: Semantics, decidability, and complexity issues, On the complexity of propositional and relational credal networks, Answering regular path queries in expressive description logics via alternating tree-automata, The role of semantics in mining frequent patterns from knowledge bases in description logics with rules, Inductive Logic Programming in Databases: From <scp>Datalog</scp> to, Decidability of Circumscribed Description Logics Revisited, Tractable query answering and rewriting under description logic constraints, Top-\(k\) retrieval for ontology mediated access to relational databases, Unnamed Item, Tightly Integrated Probabilistic Description Logic Programs for Representing Ontology Mappings, Linking Data to Ontologies, Optimized Query Rewriting for OWL 2 QL, Query answering DL-lite knowledge bases from hidden datasets, Inlining External Sources in Answer Set Programs, Characterizing Boundedness in Chase Variants, Investigating the Mapping between Default Logic and Inconsistency-Tolerant Semantics, Polynomial rewritings from expressive description logics with closed predicates to variants of Datalog, Formal Properties of Modularisation, Unnamed Item, Conservative Retractions of Propositional Logic Theories by Means of Boolean Derivatives: Theoretical Foundations, Foundations of Temporal Conceptual Data Models, Conceptual Modeling for Data Integration, Tightly Coupled Probabilistic Description Logic Programs for the Semantic Web, Description Logics, Ontologies and Databases: The DL-Lite Approach, A Single Approach to Decide Chase Termination on Linear Existential Rules, Query Answering with DBoxes is Hard, 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, Rewriting Conjunctive Queries over Description Logic Knowledge Bases, Query Rewriting under Linear $$\mathcal {EL}$$ Knowledge Bases, Scalable Reasoning by Abstraction Beyond DL-Lite, Negative Knowledge for Certain Query Answers, The incredible ELK. From polynomial procedures to efficient reasoning with \(\mathcal {EL}\) ontologies, Games for query inseparability of description logic knowledge bases
Cites Work
- Unnamed Item
- Unnamed Item
- Data complexity of query answering in description logics
- Data complexity of query answering in expressive description logics via tableaux
- Testing containment of conjunctive queries under functional and inclusion dependencies
- An epistemic operator for description logics
- Combining Horn rules and description logics in CARIN
- Integrity constraints for XML
- Tractable reasoning and efficient query answering in description logics: The DL-Lite family
- On Instance-level Update and Erasure in Description Logic Ontologies
- Deduction in Concept Languages: from Subsumption to Instance Checking
- Answer sets for consistent query answering in inconsistent databases
- Recursive query plans for data integration
- Linking Data to Ontologies
- Data Integration through ${\textit{DL-Lite}_{\mathcal A}}$ Ontologies
