Reasoning with Inconsistent Possibilistic Description Logics Ontologies with Disjunctive Assertions
- Autores: Sergio Alejandro Gómez
- Localización: Journal of Computer Science and Technology, ISSN-e 1666-6038, Vol. 15, Nº. 2, 2015, págs. 68-74
- Idioma: inglés
- Enlaces
-
Resumen
We present a preliminary framework for reasoning with possibilistic description logics ontologies with disjunctive assertions (PoDLoDA ontologies for short). Given a PoDLoDA ontology, its terminological box is expressed in the description logic programming fragment but its assertional box allows four kinds of statements: an individual is a member of a concept, two individuals are related through a role, an individual is a member of the union of two or more concepts or two individuals are related through the union of two or more roles. Axioms and statements in PoDLoDA ontologies have a numerical certainty degree attached. A disjunctive assertion expresses a doubt respect to the membership of either individuals to union of concepts or pairs of individuals to the union of roles. Because PoDLoDA ontologies allow to represent incomplete and potentially inconsistent information, instance checking is addressed through an adaptation of Bodanza’s Suppositional Argumentation System that allows to reason with modus ponens and constructive dilemmas. We think that our approach will be of use for implementers of reasoning systems in the Semantic Web where uncertainty of membership of individuals to concepts or roles is present.
