An argumentation system for reasoning with conflict-minimal paraconsistent ALC

Wenzhao Qiao, Nico Roos

Research output: Contribution to journalArticleAcademicpeer-review

Abstract

The semantic web is an open and distributed environment in which it is hard to guarantee consistency of knowledge and information. Under the standard two-valued semantics everything is entailed if knowledge and information is inconsistent. The semantics of the paraconsistent logic LP offers a solution. However, if the available knowledge and information is consistent, the set of conclusions entailed under the three-valued semantics of the paraconsistent logic LP is smaller than the set of conclusions entailed under the two-valued semantics. Preferring conflict-minimal three-valued interpretations eliminates this difference. Preferring conflict-minimal interpretations introduces non-monotonicity. To handle the non-monotonicity, this paper proposes an assumption-based argumentation system. Assumptions needed to close branches of a semantic tableaux form the arguments. Stable extensions of the set of derived arguments correspond to conflict minimal interpretations and conclusions entailed by all conflict-minimal interpretations are supported by arguments in all stable extensions.
Original languageEnglish
JournalProceedings of the Ieee
Publication statusPublished - 30 Apr 2014

Keywords

  • cs.AI

Cite this

@article{63b6542826fd4f67a7ff282088563456,
title = "An argumentation system for reasoning with conflict-minimal paraconsistent ALC",
abstract = "The semantic web is an open and distributed environment in which it is hard to guarantee consistency of knowledge and information. Under the standard two-valued semantics everything is entailed if knowledge and information is inconsistent. The semantics of the paraconsistent logic LP offers a solution. However, if the available knowledge and information is consistent, the set of conclusions entailed under the three-valued semantics of the paraconsistent logic LP is smaller than the set of conclusions entailed under the two-valued semantics. Preferring conflict-minimal three-valued interpretations eliminates this difference. Preferring conflict-minimal interpretations introduces non-monotonicity. To handle the non-monotonicity, this paper proposes an assumption-based argumentation system. Assumptions needed to close branches of a semantic tableaux form the arguments. Stable extensions of the set of derived arguments correspond to conflict minimal interpretations and conclusions entailed by all conflict-minimal interpretations are supported by arguments in all stable extensions.",
keywords = "cs.AI",
author = "Wenzhao Qiao and Nico Roos",
note = "No DOI",
year = "2014",
month = "4",
day = "30",
language = "English",
journal = "Proceedings of the Ieee",
issn = "0018-9219",
publisher = "IEEE",

}

An argumentation system for reasoning with conflict-minimal paraconsistent ALC. / Qiao, Wenzhao; Roos, Nico.

In: Proceedings of the Ieee, 30.04.2014.

Research output: Contribution to journalArticleAcademicpeer-review

TY - JOUR

T1 - An argumentation system for reasoning with conflict-minimal paraconsistent ALC

AU - Qiao, Wenzhao

AU - Roos, Nico

N1 - No DOI

PY - 2014/4/30

Y1 - 2014/4/30

N2 - The semantic web is an open and distributed environment in which it is hard to guarantee consistency of knowledge and information. Under the standard two-valued semantics everything is entailed if knowledge and information is inconsistent. The semantics of the paraconsistent logic LP offers a solution. However, if the available knowledge and information is consistent, the set of conclusions entailed under the three-valued semantics of the paraconsistent logic LP is smaller than the set of conclusions entailed under the two-valued semantics. Preferring conflict-minimal three-valued interpretations eliminates this difference. Preferring conflict-minimal interpretations introduces non-monotonicity. To handle the non-monotonicity, this paper proposes an assumption-based argumentation system. Assumptions needed to close branches of a semantic tableaux form the arguments. Stable extensions of the set of derived arguments correspond to conflict minimal interpretations and conclusions entailed by all conflict-minimal interpretations are supported by arguments in all stable extensions.

AB - The semantic web is an open and distributed environment in which it is hard to guarantee consistency of knowledge and information. Under the standard two-valued semantics everything is entailed if knowledge and information is inconsistent. The semantics of the paraconsistent logic LP offers a solution. However, if the available knowledge and information is consistent, the set of conclusions entailed under the three-valued semantics of the paraconsistent logic LP is smaller than the set of conclusions entailed under the two-valued semantics. Preferring conflict-minimal three-valued interpretations eliminates this difference. Preferring conflict-minimal interpretations introduces non-monotonicity. To handle the non-monotonicity, this paper proposes an assumption-based argumentation system. Assumptions needed to close branches of a semantic tableaux form the arguments. Stable extensions of the set of derived arguments correspond to conflict minimal interpretations and conclusions entailed by all conflict-minimal interpretations are supported by arguments in all stable extensions.

KW - cs.AI

M3 - Article

JO - Proceedings of the Ieee

JF - Proceedings of the Ieee

SN - 0018-9219

ER -