$\mathcal{ALE}$ Defeasible Description Logic

Abstract

Abstract. One of Semantic Web strengths is the ability to address incomplete knowledge. However, at present, it cannot handle incomplete knowledge directly. Also, it cannot handle non-monotonic reasoning. In this paper, we extend ALC − Defeasible Description Logic with existential quantifier, i.e., ALE Defeasible Description Logic. Also, we modify some parts of the logic, resulting in an increasing efficiency in its reasoning.

Practical Reasoning for Defeasible Description Logics

“…Here is a simple instance of this weakness: given the set of DL subsump- We have mentioned an extension of this approach [155] which allows expression of existential restrictions in rules. However, there is no accompanying mechanism for deriving relevant inferences from these.…”

“…Pothipruk and Governatori [155] later extend this approach to allow expression of existential restrictions in the KB but they do not formulate inference rules for defeasible derivation of such information. In summary, the combination of defeasible logic and DLs follows the basic model of placing rules on top of an underlying DL ontology and using the inference mechanisms of defeasible logic to draw conclusions using these rules.…”