Reasoning with Inconsistent Possibilistic Ontologies by Applying Argument Accrual
Journal of Computer Science and Technology · 2017
DOI: 10.24215/16666038.17.e16 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Computer Science and Technology, 2017. Verfasst von Sergio Alejandro Gómez. Der Volltext ist frei zugänglich (Open Access, CC BY-NC 4.0).
Abstract (Originalsprache)
We present an approach for performing instance checking in possibilistic description logic programming ontologies by accruing arguments that support the membership of individuals to concepts. Ontologies are interpreted as possibilistic logic programs where accruals of arguments as regarded as vertexes in an abstract argumentation framework. A suitable attack relation between accruals is defined. We present a reasoning framework with a case study and a Java-based implementation for enacting the proposed approach that is capable of reasoning under Dung’s grounded semantics.
Zitieren
APA
Gómez, S. A. (2017). Reasoning with Inconsistent Possibilistic Ontologies by Applying Argument Accrual. Journal of Computer Science and Technology. https://doi.org/10.24215/16666038.17.e16
Vancouver
Gómez SA. Reasoning with Inconsistent Possibilistic Ontologies by Applying Argument Accrual. Journal of Computer Science and Technology. 2017. doi:10.24215/16666038.17.e16
BibTeX
@article{Gmez2017,
author = {Gómez, Sergio Alejandro},
title = {Reasoning with Inconsistent Possibilistic Ontologies by Applying Argument Accrual},
journal = {Journal of Computer Science and Technology},
year = {2017},
doi = {10.24215/16666038.17.e16}
}
EUVIMED