Reasoning with Inconsistent Possibilistic Ontologies by Applying Argument Accrual

Journal of Computer Science and Technology

Sergio Alejandro Gómez¹ 

[1] Laboratorio de Desarrollo e Investigación en Inteligencia Artificial (LIDIA), Instituto de Ciencias e Ingeniería de la Computación (ICIC), Departamento de Ciencias e Ingeniería de la Computación (DCIC), Universidad Nacional del Sur (UNS), San Andrés 800 - Campus de Palihue (8000) Bahía Blanca, Argentina;

关键词: argument accrual;    ontology reasoning;    inconsistency handling;    description logics;   

DOI  :  10.24215/16666038.17.e16

来源: DOAJ

【 摘 要 】

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.

【 授权许可】

Unknown