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...
| Autor: | |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2017 |
| País: | Argentina |
| Institución: | Universidad Nacional de La Plata |
| Repositorio: | SEDICI (UNLP) |
| Idioma: | inglés |
| OAI Identifier: | oai:sedici.unlp.edu.ar:10915/62938 |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/62938 |
| Access Level: | acceso abierto |
| Palabra clave: | Ciencias Informáticas argument accrual ontology reasoning inconsistency handling description logics |
| 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. |
|---|