The semantic web is an open and distributed environment in which it is hard to guarantee consistency of knowledge and information. Under the standard twovalued 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 threevalued semantics of the paraconsistent logic LP is smaller than the set of conclusions entailed under the twovalued semantics. Preferring conflictminimal threevalued interpretations eliminates this difference. Preferring conflictminimal interpretations introduces nonmonotonicity. To handle the nonmonotonicity, this paper proposes an assumptionbased 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 conflictminimal interpretations are supported by arguments in all stable extensions.
Cite this

APA

Author

BIBTEX

Harvard

Standard

RIS

Vancouver
@article{63b6542826fd4f67a7ff282088563456,
title = "An argumentation system for reasoning with conflictminimal 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 twovalued 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 threevalued semantics of the paraconsistent logic LP is smaller than the set of conclusions entailed under the twovalued semantics. Preferring conflictminimal threevalued interpretations eliminates this difference. Preferring conflictminimal interpretations introduces nonmonotonicity. To handle the nonmonotonicity, this paper proposes an assumptionbased 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 conflictminimal interpretations are supported by arguments in all stable extensions.",
keywords = "cs.AI",
author = "Wenzhao Qiao and Nico Roos",
note = "No DOI",
year = "2014",
month = apr
day = "30",
language = "English",
journal = "Proceedings of the Ieee",
issn = "00189219",
publisher = "IEEE",
}
TY  JOUR
T1  An argumentation system for reasoning with conflictminimal 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 twovalued 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 threevalued semantics of the paraconsistent logic LP is smaller than the set of conclusions entailed under the twovalued semantics. Preferring conflictminimal threevalued interpretations eliminates this difference. Preferring conflictminimal interpretations introduces nonmonotonicity. To handle the nonmonotonicity, this paper proposes an assumptionbased 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 conflictminimal 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 twovalued 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 threevalued semantics of the paraconsistent logic LP is smaller than the set of conclusions entailed under the twovalued semantics. Preferring conflictminimal threevalued interpretations eliminates this difference. Preferring conflictminimal interpretations introduces nonmonotonicity. To handle the nonmonotonicity, this paper proposes an assumptionbased 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 conflictminimal 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  00189219
ER 