the case in which T is a DL-lite R Tbox, if one of the statements, cl (T ), then all three such statements are in cl (T ) ,
Foundations of Databases, 1995. ,
The Description Logic Handbook: Theory, Implementation, and Applications, 2003. ,
DOI : 10.1017/CBO9780511711787
Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family, Journal of Automated Reasoning, vol.104, issue.1,2, pp.385-429, 2007. ,
DOI : 10.1007/s10817-007-9078-x
Extracting modules from ontologies: A logic-based approach, OWLED, 2007. ,
Just the right amount: extracting modules from ontologies, WWW, 2007. ,
An extension of sol-resolution to theories with equality, IJCAR, 2001. ,
Did I damage my ontology? a case for conservative extensions in description logics, KR, 2006. ,
Linear resolution for consequence finding, Artificial Intelligence, vol.56, issue.2-3, pp.2-3, 1992. ,
DOI : 10.1016/0004-3702(92)90030-2
Semantic modularity and module extraction in description logics, ECAI, 2008. ,
Forgetting and uniform interpolation in extensions of the description logic EL, Description Logics, 2009. ,
Forgetting and uniform interpolation in large-scale description logic terminologies, IJCAI, 2009. ,
Minimal module extraction from DL-Lite ontologies using QBF solvers, IJCAI, 2009. ,
Modularity in DLlite, DL, 2007. ,
Conservative extensions in expressive description logics, IJCAI, 2007. ,
Linking Data to Ontologies, J. Data Semantics, vol.10, 2008. ,
DOI : 10.1007/978-3-540-77688-8_5
The complexity of relational query languages, STOC, 1982. ,
Concept and Role Forgetting in ${\mathcal {ALC}}$ Ontologies, ISWC, 2009. ,
DOI : 10.1007/978-3-642-04930-9_42
Forgetting Concepts in DL-Lite, ESWC, 2008. ,
DOI : 10.1007/978-3-540-68234-9_20