An Approach to Generating Arguments over DL-Lite Ontologies

Year, pages: 2013, 924 - 948

Argumentation frameworks for ontology reasoning and management have received extensive interests in the field of artificial intelligence in recent years. As one of the most popular argumentation frameworks, Besnard and Hunter's framework is built on arguments in the form of (,) where  is consistent and minimal for entailing . However, the problem of generating arguments over ontologies is still open. This paper presents an approach to generating arguments over DL-Lite ontologies by searching support paths in focal graphs. Moreover, theoretical results and examples are provided to ensure the correctness of this approach. Finally, we show that approach has the same complexity as propositional revision.

Zhang, X., Lin, Z. 2013. An Approach to Generating Arguments over DL-Lite Ontologies. In Computing and Informatics, vol. 32, no.5, pp. 924-948. 1335-9150.

Zhang, X., Lin, Z. (2013). An Approach to Generating Arguments over DL-Lite Ontologies. Computing and Informatics, 32(5), 924-948. 1335-9150.