Semantic Forgetting in Expressive Description Logics

Computing Sufficient and Necessary Conditions in CTL: A Forgetting Approach

“…As an ontology engineering technique to produce views of ontologies, forgetting has been widely explored in the subclasses of FOL, i.e., description logics (DLs) [22]. In particular, Sakr et al explored the method of forgetting names to capture the semantic information over a signature of a given ontology [8], and Zhao et al investigated a practical and efficient tool for the problem of forgetting in DLs with nominal [23]. In addition to ontology extraction [24], forgetting in description logic is also used for abduction reasoning [25].…”

“…For instance, even deciding whether a disjunctive normal form (DNF) formula is the result of forgetting a set of atoms from another DNF formula is co-NP-complete [6]. Moreover, knowledge management in organisational contexts [7], socio-digital systems, and ontology extraction [8] are important in agent systems to guarantee individual privacy by blinding out irrelevant information. In addition, when a given system M does not satisfy a property u, it is also a challenge to find a as weak as possible condition under which the property u holds in M. In this case, two logical notions are very helpful: the weakest sufficient condition (WSC) and the strongest necessary condition (SNC) under a given property [9].…”