Skip to Main content Skip to Navigation
New interface
Conference papers

A Defeasible Reasoning Approach for Description Logic Ontologies

Abstract : Classical reasoning for logic-based KR (Knowledge Representation) systems is in general, monotonic. That is, there is an assumption in these systems that there is complete information about a domain. This means that they generally cannot deal with any new information arising which contradicts with the current information. This is not an appropriate model for reasoning in many applications. Therefore, alternative non-monotonic systems have been investigated which can reason under uncertainty or with incomplete information. Defeasible reasoning is one particular model for implementing non-monotonic reasoning. It is concerned with representing and reasoning with defeasible (non-strict) facts about a domain. The defeasible counterpart of the strict fact: "All birds fly" is the defeasible fact: "Most birds fly" (or the alternative phrasing "Birds usually fly"). We discuss two approaches for defeasible reasoning in the family of logic-based KR languages known as Description Logics (DLs). They are applicable to particular extensions of DLs that allow for the statement of defeasible sentences similar to the aforementioned examples. The approaches are known as prototypical reasoning and presumptive reasoning and are both rooted in the notion of Rational Closure developed by Lehmann and Magidor for an extension of propositional logic. Here we recast their definitions in a DL context and define algorithms for prototypical and presumptive reasoning for DL knowledge bases (also called DL ontologies) that may contain defeasible sentences. In particular, we present a plug-in for the Protégé ontology editor which implements these algorithms for OWL ontologies - the Web Ontology Language (OWL) is a formal standard of languages whose semantic basis is identical to that of DLs. Our plug-in, RaMP, allows the modeller to indicate defeasible information in OWL ontologies and perform logical inferencing to determine what defeasible conclusions one can draw from these ontologies.
Document type :
Conference papers
Complete list of metadata

https://hal-univ-artois.archives-ouvertes.fr/hal-03673818
Contributor : Fabien DELORME Connect in order to contact the contributor
Submitted on : Friday, May 20, 2022 - 11:20:28 AM
Last modification on : Friday, May 20, 2022 - 11:30:50 AM

Identifiers

Collections

Citation

Kodylan Moodley, Thomas Meyer, Ivan Varzinczak. A Defeasible Reasoning Approach for Description Logic Ontologies. Annual Conference of the South African Institute for Computer Scientists and Information Technologists (SAICSIT 2012), 2012, Centurion, South Africa. pp.69-78, ⟨10.1145/2389836.2389845⟩. ⟨hal-03673818⟩

Share

Metrics

Record views

4