ResearchSpace

Relevant closure: a new form of defeasible reasoning for description logics

Show simple item record

dc.contributor.author Casini, G
dc.contributor.author Meyer, T
dc.contributor.author Moodley, K
dc.contributor.author Nortjé, R
dc.date.accessioned 2015-10-15T08:09:17Z
dc.date.available 2015-10-15T08:09:17Z
dc.date.issued 2014-09
dc.identifier.citation Casini, G, Meyer, T, Moodley, K and Nortjé, R. 2014. Relevant closure: a new form of defeasible reasoning for description logics. In: 14th European Conference on Logics in Artificial Intelligence JELIA, Madeira, Spain, 24-26 September 2014 en_US
dc.identifier.isbn 978-3-319-11557-3
dc.identifier.uri http://link.springer.com/chapter/10.1007%2F978-3-319-11558-0_7
dc.identifier.uri http://hdl.handle.net/10204/8192
dc.description 14th European Conference on Logics in Artificial Intelligence JELIA, Madeira, Spain, 24-26 September 2014 en_US
dc.description.abstract Among the various proposals for defeasible reasoning for description logics, Rational Closure, a procedure originally defined for propositional logic, turns out to have a number of desirable properties. Not only it is computationally feasible, but it can also be implemented using existing classical reasoners. One of its drawbacks is that it can be seen as too weak from the inferential point of view. To overcome this limitation we introduce in this paper two extensions of Rational Closure: Basic Relevant Closure and Minimal Relevant Closure. As the names suggest, both rely on defining a version of relevance. Our formalisation of relevance in this context is based on the notion of a justification (a minimal subset of sentences implying a given sentence). This is, to our knowledge, the first proposal for defining defeasibility in terms of justifications—a notion that is well-established in the area of ontology debugging. Both Basic and Minimal Relevant Closure increase the inferential power of Rational Closure, giving back intuitive conclusions that cannot be obtained from Rational Closure. We analyse the properties and present algorithms for both Basic and Minimal Relevant Closure, and provide experimental results for both Basic Relevant Closure and Minimal Relevant Closure, comparing it with Rational Closure. en_US
dc.language.iso en en_US
dc.publisher Springer International Publishing en_US
dc.relation.ispartofseries Workflow;14676
dc.subject Rational closure en_US
dc.subject Description logics en_US
dc.subject Artificial intelligence en_US
dc.title Relevant closure: a new form of defeasible reasoning for description logics en_US
dc.type Conference Presentation en_US
dc.identifier.apacitation Casini, G., Meyer, T., Moodley, K., & Nortjé, R. (2014). Relevant closure: a new form of defeasible reasoning for description logics. Springer International Publishing. http://hdl.handle.net/10204/8192 en_ZA
dc.identifier.chicagocitation Casini, G, T Meyer, K Moodley, and R Nortjé. "Relevant closure: a new form of defeasible reasoning for description logics." (2014): http://hdl.handle.net/10204/8192 en_ZA
dc.identifier.vancouvercitation Casini G, Meyer T, Moodley K, Nortjé R, Relevant closure: a new form of defeasible reasoning for description logics; Springer International Publishing; 2014. http://hdl.handle.net/10204/8192 . en_ZA
dc.identifier.ris TY - Conference Presentation AU - Casini, G AU - Meyer, T AU - Moodley, K AU - Nortjé, R AB - Among the various proposals for defeasible reasoning for description logics, Rational Closure, a procedure originally defined for propositional logic, turns out to have a number of desirable properties. Not only it is computationally feasible, but it can also be implemented using existing classical reasoners. One of its drawbacks is that it can be seen as too weak from the inferential point of view. To overcome this limitation we introduce in this paper two extensions of Rational Closure: Basic Relevant Closure and Minimal Relevant Closure. As the names suggest, both rely on defining a version of relevance. Our formalisation of relevance in this context is based on the notion of a justification (a minimal subset of sentences implying a given sentence). This is, to our knowledge, the first proposal for defining defeasibility in terms of justifications—a notion that is well-established in the area of ontology debugging. Both Basic and Minimal Relevant Closure increase the inferential power of Rational Closure, giving back intuitive conclusions that cannot be obtained from Rational Closure. We analyse the properties and present algorithms for both Basic and Minimal Relevant Closure, and provide experimental results for both Basic Relevant Closure and Minimal Relevant Closure, comparing it with Rational Closure. DA - 2014-09 DB - ResearchSpace DP - CSIR KW - Rational closure KW - Description logics KW - Artificial intelligence LK - https://researchspace.csir.co.za PY - 2014 SM - 978-3-319-11557-3 T1 - Relevant closure: a new form of defeasible reasoning for description logics TI - Relevant closure: a new form of defeasible reasoning for description logics UR - http://hdl.handle.net/10204/8192 ER - en_ZA


Files in this item

This item appears in the following Collection(s)

Show simple item record