The DL-Lite Family and Relations
From MaRDI portal
Publication:3651482
DOI10.1613/JAIR.2820zbMATH Open1192.68657arXiv1401.3487OpenAlexW3101483322WikidataQ62048637 ScholiaQ62048637MaRDI QIDQ3651482FDOQ3651482
Diego Calvanese, Michael Zakharyaschev, Alessandro Artale, Roman Kontchakov
Publication date: 10 December 2009
Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)
Abstract: The recently introduced series of description logics under the common moniker DL-Lite has attracted attention of the description logic and semantic web communities due to the low computational complexity of inference, on the one hand, and the ability to represent conceptual modeling formalisms, on the other. The main aim of this article is to carry out a thorough and systematic investigation of inference in extensions of the original DL-Lite logics along five axes: by (i) adding the Boolean connectives and (ii) number restrictions to concept constructs, (iii) allowing role hierarchies, (iv) allowing role disjointness, symmetry, asymmetry, reflexivity, irreflexivity and transitivity constraints, and (v) adopting or dropping the unique same assumption. We analyze the combined complexity of satisfiability for the resulting logics, as well as the data complexity of instance checking and answering positive existential queries. Our approach is based on embedding DL-Lite logics in suitable fragments of the one-variable first-order logic, which provides useful insights into their properties and, in particular, computational behavior.
Full work available at URL: https://arxiv.org/abs/1401.3487
Cited In (60)
- On combining ontologies and rules
- Deciding FO-rewritability of Regular Languages and Ontology-Mediated Queries in Linear Temporal Logic
- Reasoning with ontologies
- Semantic web
- Fuzzy OWL-Boost: learning fuzzy concept inclusions via real-valued boosting
- Designing efficient controlled languages for ontologies
- Tractable closure-based possibilistic repair for partially ordered DL-Lite ontologies
- Generalized satisfiability for the description logic \(\mathcal{ALC}\)
- Games for query inseparability of description logic knowledge bases
- Title not available (Why is that?)
- First-Order Rewritability and Complexity of Two-Dimensional Temporal Ontology-Mediated Queries
- Actions over core-closed 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
- The Probabilistic Description Logic
- Foundations of ontology-based data access under bag semantics
- Logic-based ontology comparison and module extraction, with an application to DL-Lite
- Tractability and intractability of controlled languages for data access
- The price of query rewriting in ontology-based data access
- View-based query answering in description logics: semantics and complexity
- A polynomial time subsumption algorithm for nominal safe \(\mathcal{ELO}_\bot\) under rational closure
- Datalog rewritability of disjunctive Datalog programs and non-Horn ontologies
- Decidability of Circumscribed Description Logics Revisited
- First-order rewritability of ontology-mediated queries in linear temporal logic
- Ontology-Mediated Query Answering with Data-Tractable Description Logics
- Knowledge base exchange: the case of OWL 2 QL
- Tailoring Temporal Description Logics for Reasoning over Temporal Conceptual Models
- DL-Lite Ontology Revision Based on An Alternative Semantic Characterization
- A Cookbook for Temporal Conceptual Data Modelling with Description Logics
- Circuit Complexity Meets Ontology-Based Data Access
- Assertional Removed Sets Merging of DL-Lite Knowledge Bases
- On the logical properties of the nonmonotonic description logic \(\mathcal{DL}^{\operatorname{N}}\)
- A tetrachotomy of ontology-mediated queries with a covering axiom
- DL-Lite with Temporalised Concepts, Rigid Axioms and Roles
- Inseparability and Conservative Extensions of Description Logic Ontologies: A Survey
- Logical foundations of information disclosure in ontology-based data integration
- Adding Metalogic Features to Knowledge Representation Languages*
- Analyzing real-world SPARQL queries and ontology-based data access in the context of probabilistic data
- Ontologies and Databases: The DL-Lite Approach
- Inconsistency-Tolerant Querying of Description Logic Knowledge Bases
- A distance-based framework for inconsistency-tolerant reasoning and inconsistency measurement in DL-Lite
- Understanding the complexity of axiom pinpointing in lightweight description logics
- Optimized Query Rewriting for OWL 2 QL
- Answering regular path queries mediated by unrestricted \(\mathcal{SQ}\) ontologies
- OWL 2 Profiles: An Introduction to Lightweight Ontology Languages
- Consequence-based and fixed-parameter tractable reasoning in description logics
- Query answering DL-lite knowledge bases from hidden datasets
- Towards more expressive ontology languages: the query answering problem
- Generalized Satisfiability for the Description Logic $\mathcal{ALC}$
- Bounds in ontology-based data access via circuit complexity
- Uncertain lightweight ontologies in a product-based possibility theory framework
- Optimizing the computation of overriding in \(\mathcal{DL}^{\mathsf{N}}\)
- Prioritized assertional-based removed sets revision of \textit{DL}-\textit{Lite} belief bases
- The complexity of Bayesian networks specified by propositional and relational languages
- Capturing model-based ontology evolution at the instance level: the case of DL-Lite
- Title not available (Why is that?)
- Title not available (Why is that?)
- Exact Query Reformulation with First-Order Ontologies and Databases
- Scalable Reasoning by Abstraction Beyond DL-Lite
- The finite model theory of Bayesian network specifications: descriptive complexity and zero/one laws
Recommendations
- Another Look at the Dwork Family π π
- Programming Languages and Systems π π
- On the strength and scope of DLS π π
- Lightweight family polymorphism π π
- The \(t\) family and their close and distant relations π π
- DL-Lite Contraction and Revision π π
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
This page was built for publication: The DL-Lite Family and Relations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3651482)