DSpace
 

Researchspace >
General science, engineering & technology >
General science, engineering & technology >
General science, engineering & technology >

Please use this identifier to cite or link to this item: http://hdl.handle.net/10204/6366

Title: A defeasible reasoning approach for description logic ontologies
Authors: Moodley, K
Meyer, T
Varzinczak, IJ
Keywords: Computing methodologies
Artificial intelligence
Algorithms
Logic-based knowledge representation
Issue Date: Oct-2012
Publisher: ACM
Citation: Moodley, K, Meyer, T and Varzinczak, IJ. A defeasible reasoning approach for description logic ontologies. SA Institute for Computer Scientists and Information Technologies (SAICSIT) Conference, Pretoria, South Africa, 1-3 October 2012
Series/Report no.: Workflow;9897
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 (nonstrict) 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 logicbased 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.
Description: Copyright: 2011 ACM. This is an ABSTRACT ONLY. The definitive version can be found at http://dl.acm.org/citation.cfm?id=2389845
URI: http://dl.acm.org/citation.cfm?id=2389845
http://hdl.handle.net/10204/6366
ISBN: 978-1-4503-1308-7
Appears in Collections:Digital intelligence
General science, engineering & technology

Files in This Item:

File Description SizeFormat
Moodley_2012.pdf182.91 kBAdobe PDFView/Open
View Statistics

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

 

Valid XHTML 1.0! DSpace Software Copyright © 2002-2010  Duraspace - Feedback