# The DL-Lite Family and Relations

@article{Artale2009TheDF,
title={The DL-Lite Family and Relations},
author={Alessandro Artale and Diego Calvanese and Roman Kontchakov and Michael Zakharyaschev},
journal={J. Artif. Intell. Res.},
year={2009},
volume={36},
pages={1-69}
}
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… Expand
546 Citations
• Computer Science
• Description Logics
• 2009
In this paper we extend the logic DL-LiteNbool and its fragments with (i) role inclusions, (ii) qualified number restrictions and (iii) role disjointness, symmetry, asymmetry, reflexivity andExpand
DL-Lite without UNA
• Computer Science
• Description Logics
• 2009
The aim of this paper is to investigate in depth the impact of dropping the UNA on both the combined and data complexity of reasoning in the DL-Lite family and extensions, classified according to the following features. Expand
A refresher on DL-Lite logic
• 2015
DL-Lite is one of the most important fragments of description logics that allows a flexible representation of knowledge with a tractable computational complexity of the reasoning process. ThisExpand
DL-Lite with Attributes and Sub-Roles (Extended Abstract)
• Computer Science
• Description Logics
• 2011
The DL-Lite languages of [3] are extended by relaxing the restriction on the interaction between cardinality constraints (N ) and role inclusions (or hierarchies) and a new family of languages, DL- liteHNA α , α ∈ {core, krom, horn, bool}, are introduced, extending DL- Lite with attributes (A). Expand
DL-Lite and Interval Temporal Logics: a Marriage Proposal
• Computer Science
• ECAI
• 2014
This work proposes to extend DL-Lite with fragments of Halpern and Shoham's interval logic of Allen's relations (HS), and formally defines such extensions and shows how they can be successfully used in knowledge representation. Expand
Extending DL-Lite Sometime in the Future
• Computer Science
• Description Logics
• 2009
The history of the development of both interval and point-based temporal extensions of DLs is discussed in full detail, with a number of complexity results obtained for different combinations of temporal operators and DLs. Expand
Ontological Commitments, DL-Lite Logics and Reasoning Tractability
• Computer Science
• 2015
It is shown that, regarding time complexity, the satisfiability problem for the boolean fragment of the presented family is tractable, in marked contrast to DL-Lite$$_{bool}^\mathcal {N}$$, and its NP-complete Satisfiability problem. Expand
Min-based possibilistic DL-Lite
• Computer Science
• J. Log. Comput.
• 2017
A Prioritized Assertional-Based Revision for DL-Lite Knowledge Bases
• Computer Science
• JELIA
• 2014
This paper investigates "Prioritized Removed Sets Revision" (PRSR) in DL-Lite framework where the assertions or data are prioritized (for instance in case where the data are provided by multiple sources having different reliability levels) and shows how to use the notion of hitting sets for computing prioritized removed sets in polynomial time. Expand
Boolean Role Inclusions in DL-Lite With and Without Time
• Computer Science
• KR
• 2020
It is shown that the restriction to Krom and Horn role inclusions leads to much lower complexity in the atemporal case and to decidability (and EXPSPACEcompleteness) in the temporal case, even if one admits full Booleans on concepts. Expand

#### References

SHOWING 1-10 OF 91 REFERENCES
DL-Lite in the Light of First-Order Logic
• Computer Science
• AAAI
• 2007
This paper proposes DL-Litebool, an extension of DL- lite with full Booleans and number restrictions, and study the complexity of reasoning in DL- Litebool and its significant sub-logics, and obtains results by a novel reduction to the one-variable fragment of first-order logic. Expand
DL-Lite: Tractable Description Logics for Ontologies
• Computer Science
• AAAI
• 2005
DL-Lite is proposed, a new Description Logic specifically tailored to capture basic ontology languages, while keeping low complexity of reasoning, and shows that in DL-LITE the usual DL reasoning tasks are polynomial in the size of the TBox, and query answering is polynometric in theSize of the ABox, the first result of polynomic data complexity for query answering over DL knowledge bases. Expand
Complexity results and practical algorithms for logics in knowledge representation
A number of novel complexity results and practical algorithms for expressive DLs that provide different forms of counting quantifiers are established and it is shown that, in many cases, adding local counting in the form of qualifying number restrictions to DLs does not increase the complexity of the inference problems, even if binary coding of numbers in the input is assumed. Expand
Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family
• Computer Science
• Journal of Automated Reasoning
• 2007
It is shown that, for the DLs of the DL-Lite family, the usual DL reasoning tasks are polynomial in the size of the TBox, and query answering is LogSpace in thesize of the ABox, which is the first result ofPolynomial-time data complexity for query answering over DL knowledge bases. Expand
Data Complexity of Query Answering in Expressive Description Logics via Tableaux
• Computer Science
• Journal of Automated Reasoning
• 2008
It is established that, for a whole range of sublogics of $\mathcal{SHOIQ}$ that contain $\Mathcal{AL}$, answering such queries has coNP-complete data complexity, and a tight coNP upper bound for positive existential queries without transitive roles is proved. Expand
Practical Reasoning for Very Expressive Description Logics
• Mathematics, Computer Science
• Log. J. IGPL
• 2000
An algorithm is presented that decides satisfiability of the DL ALC extended with transitive and inverse roles and functional restrictions with respect to general concept inclusion axioms and role hierarchies; early experiments indicate that this algorithm is well-suited for implementation. Expand
DL-Lite and Role Inclusions
• Computer Science
• ASWC
• 2008
It is shown that the data complexity of instance checking becomes P -hard in the presence of functionality constraints, and coNP -hard if arbitrary number restrictions are allowed, even with primitive concept inclusions. Expand
Characterizing Data Complexity for Conjunctive Query Answering in Expressive Description Logics
• Computer Science
• AAAI
• 2006
For a whole range of DLs from AL to SHIQ, answering CQs with no transitive roles has CONP-complete data complexity, established by a novel tableaux-based algorithm for checking query entailment. Expand
The Description Logic Handbook
• Computer Science
• 2007
This introduction presents the main motivations for the development of Description Logics (DLs) as a formalism for representing knowledge, as well as some important basic notions underlying allExpand
Data Complexity of Query Answering in Description Logics
• Computer Science, Mathematics
• Description Logics
• 2005
The Description Logics of the DL-Lite family are the maximal logics allowing conjunctive query answering through standard database technology, and are the first description Logics specifically tailored for effective query answering over very large ABoxes. Expand