The DL-Lite Family and Relations
From MaRDI portal
Publication:3651482
DOI10.1613/jair.2820zbMath1192.68657arXiv1401.3487OpenAlexW3101483322WikidataQ62048637 ScholiaQ62048637MaRDI QIDQ3651482
Diego Calvanese, Alessandro Artale, Roman Kontchakov, Michael Zakharyashchev
Publication date: 10 December 2009
Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1401.3487
Related Items
DL-Lite Ontology Revision Based on An Alternative Semantic Characterization ⋮ Datalog rewritability of disjunctive Datalog programs and non-Horn ontologies ⋮ Tailoring Temporal Description Logics for Reasoning over Temporal Conceptual Models ⋮ Knowledge base exchange: the case of OWL 2 QL ⋮ Second-Order Quantifier Elimination on Relational Monadic Formulas – A Basic Method and Some Less Expected Applications ⋮ Exact Query Reformulation with First-Order Ontologies and Databases ⋮ 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 ⋮ On the logical properties of the nonmonotonic description logic \(\mathcal{DL}^{\operatorname{N}}\) ⋮ Bounds in ontology-based data access via circuit complexity ⋮ Uncertain lightweight ontologies in a product-based possibility theory framework ⋮ 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 ⋮ Understanding the complexity of axiom pinpointing in lightweight description logics ⋮ A distance-based framework for inconsistency-tolerant reasoning and inconsistency measurement in DL-Lite ⋮ A Cookbook for Temporal Conceptual Data Modelling with Description Logics ⋮ Generalized satisfiability for the description logic \(\mathcal{ALC}\) ⋮ Fuzzy OWL-Boost: learning fuzzy concept inclusions via real-valued boosting ⋮ The Probabilistic Description Logic ⋮ Logic-based ontology comparison and module extraction, with an application to DL-Lite ⋮ Answering regular path queries mediated by unrestricted \(\mathcal{SQ}\) ontologies ⋮ View-based query answering in description logics: semantics and complexity ⋮ Deciding FO-rewritability of Regular Languages and Ontology-Mediated Queries in Linear Temporal Logic ⋮ On combining ontologies and rules ⋮ Designing efficient controlled languages for ontologies ⋮ Inseparability and Conservative Extensions of Description Logic Ontologies: A Survey ⋮ Inconsistency-Tolerant Querying of Description Logic Knowledge Bases ⋮ Ontology-Mediated Query Answering with Data-Tractable Description Logics ⋮ Logical foundations of information disclosure in ontology-based data integration ⋮ The complexity of Bayesian networks specified by propositional and relational languages ⋮ A polynomial time subsumption algorithm for nominal safe \(\mathcal{ELO}_\bot\) under rational closure ⋮ 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 ⋮ First-order rewritability of ontology-mediated queries in linear temporal logic ⋮ Generalized Satisfiability for the Description Logic $\mathcal{ALC}$ ⋮ Adding Metalogic Features to Knowledge Representation Languages* ⋮ Prioritized assertional-based removed sets revision of \textit{DL}-\textit{Lite} belief bases ⋮ Reasoning and Query Answering in Description Logics ⋮ OWL 2 Profiles: An Introduction to Lightweight Ontology Languages ⋮ Tractability and intractability of controlled languages for data access ⋮ Decidability of Circumscribed Description Logics Revisited ⋮ Unnamed Item ⋮ Optimized Query Rewriting for OWL 2 QL ⋮ The finite model theory of Bayesian network specifications: descriptive complexity and zero/one laws ⋮ Query answering DL-lite knowledge bases from hidden datasets ⋮ Unnamed Item ⋮ Ontologies and Databases: The DL-Lite Approach ⋮ Foundations of ontology-based data access under bag semantics ⋮ DL-Lite with Temporalised Concepts, Rigid Axioms and Roles ⋮ Optimizing the computation of overriding in \(\mathcal{DL}^{\mathsf{N}}\) ⋮ Actions over core-closed knowledge bases ⋮ First-Order Rewritability and Complexity of Two-Dimensional Temporal Ontology-Mediated Queries ⋮ Scalable Reasoning by Abstraction Beyond DL-Lite ⋮ Games for query inseparability of description logic knowledge bases
