Header

UZH-Logo

Maintenance Infos

Default logics for plausible reasoning with controversial axioms


Scharrenbach, T; d'Amato, C; Fanizzi, N; Grütter, R; Waldvogel, B; Bernstein, A (2010). Default logics for plausible reasoning with controversial axioms. In: 6th International Workshop on Uncertainty Reasoning for the Semantic Web (URSW-2010), Shanghai, China, 7 November 2010 - 7 November 2010.

Abstract

Using a variant of Lehmann's Default Logics and Probabilistic Description Logics we recently presented a framework that invalidates those unwanted inferences that cause concept unsatisfiability without the need to remove explicitly stated axioms. The solutions of this methods were shown to outperform classical ontology repair w.r.t. the number of inferences invalidated. However, conflicts may still exist in the knowledge base and can make reasoning ambiguous. Furthermore, solutions with a minimal number of inferences invalidated do not necessarily minimize the number of conflicts. In this paper we provide an overview over finding solutions that have a minimal number of conflicts while invalidating as few inferences as possible. Specifically, we propose to evaluate solutions w.r.t. the quantity of information they convey by recurring to the notion of entropy and discuss a possible approach towards computing the entropy w.r.t. an ABox.

Abstract

Using a variant of Lehmann's Default Logics and Probabilistic Description Logics we recently presented a framework that invalidates those unwanted inferences that cause concept unsatisfiability without the need to remove explicitly stated axioms. The solutions of this methods were shown to outperform classical ontology repair w.r.t. the number of inferences invalidated. However, conflicts may still exist in the knowledge base and can make reasoning ambiguous. Furthermore, solutions with a minimal number of inferences invalidated do not necessarily minimize the number of conflicts. In this paper we provide an overview over finding solutions that have a minimal number of conflicts while invalidating as few inferences as possible. Specifically, we propose to evaluate solutions w.r.t. the quantity of information they convey by recurring to the notion of entropy and discuss a possible approach towards computing the entropy w.r.t. an ABox.

Statistics

Citations

Downloads

104 downloads since deposited on 15 Feb 2011
9 downloads since 12 months
Detailed statistics

Additional indexing

Item Type:Conference or Workshop Item (Paper), refereed, original work
Communities & Collections:03 Faculty of Economics > Department of Informatics
Dewey Decimal Classification:000 Computer science, knowledge & systems
Language:English
Event End Date:7 November 2010
Deposited On:15 Feb 2011 14:36
Last Modified:07 Dec 2017 07:03
Series Name:CEUR Workshop Proceedings
Other Identification Number:1453

Download

Download PDF  'Default logics for plausible reasoning with controversial axioms'.
Preview
Filetype: PDF
Size: 1MB