TY - JOUR

T1 - Forgetting for knowledge bases in DL-Lite

AU - Wang, Zhe

AU - Wang, Kewen

AU - Topor, Rodney

AU - Pan, Jeff Z.

PY - 2010/2/1

Y1 - 2010/2/1

N2 - To support the reuse and combination of ontologies in Semantic Web applications, it is often necessary to obtain smaller ontologies from existing larger ontologies. In particular, applications may require the omission of certain terms, e.g., concept names and role names, from an ontology. However, the task of omitting terms from an ontology is challenging because the omission of some terms may affect the relationships between the remaining terms in complex ways. We present the first solution to the problem of omitting concepts and roles from knowledge bases of description logics (DLs) by adapting the technique of forgetting, previously used in other domains. Specifically, we first introduce a model-theoretic definition of forgetting for knowledge bases (both TBoxes and ABoxes) in DL-Litebool N, which is a non-trivial adaption of the standard definition for classical logic, and show that our model-based forgetting satisfies all major criteria of a rational forgetting operator, which in turn verifies the suitability of our model-based forgetting. We then introduce algorithms that implement forgetting operations in DL-Lite knowledge bases. We prove that the algorithms are correct with respect to the semantic definition of forgetting. We establish a general framework for defining and comparing different definitions of forgetting by introducing a parameterized family of forgetting operators called query-based forgetting operators. In this framework we identify three specific query-based forgetting operators and show that they form a hierarchy. In particular, we show that the model-based forgetting coincides with one of these query-based forgetting operators.

AB - To support the reuse and combination of ontologies in Semantic Web applications, it is often necessary to obtain smaller ontologies from existing larger ontologies. In particular, applications may require the omission of certain terms, e.g., concept names and role names, from an ontology. However, the task of omitting terms from an ontology is challenging because the omission of some terms may affect the relationships between the remaining terms in complex ways. We present the first solution to the problem of omitting concepts and roles from knowledge bases of description logics (DLs) by adapting the technique of forgetting, previously used in other domains. Specifically, we first introduce a model-theoretic definition of forgetting for knowledge bases (both TBoxes and ABoxes) in DL-Litebool N, which is a non-trivial adaption of the standard definition for classical logic, and show that our model-based forgetting satisfies all major criteria of a rational forgetting operator, which in turn verifies the suitability of our model-based forgetting. We then introduce algorithms that implement forgetting operations in DL-Lite knowledge bases. We prove that the algorithms are correct with respect to the semantic definition of forgetting. We establish a general framework for defining and comparing different definitions of forgetting by introducing a parameterized family of forgetting operators called query-based forgetting operators. In this framework we identify three specific query-based forgetting operators and show that they form a hierarchy. In particular, we show that the model-based forgetting coincides with one of these query-based forgetting operators.

KW - Description logics

KW - Forgetting

KW - Ontology

UR - http://www.scopus.com/inward/record.url?scp=78649517777&partnerID=8YFLogxK

U2 - 10.1007/s10472-010-9187-9

DO - 10.1007/s10472-010-9187-9

M3 - Article

AN - SCOPUS:78649517777

VL - 58

SP - 117

EP - 151

JO - Annals of Mathematics and Artificial Intelligence

JF - Annals of Mathematics and Artificial Intelligence

SN - 1012-2443

IS - 1

ER -