Reasoning with Inconsistent Possibilistic Ontologies by Applying Argument Accrual
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 vertex...
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Articulo |
| Lenguaje: | Inglés |
| Publicado: |
2017
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/62938 http://journal.info.unlp.edu.ar/wp-content/uploads/2017/10/JCST-45-Paper-4.pdf |
| Aporte de: |
| Sumario: | 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. |
|---|