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 form of where Phi is consistent and minimal for entailing phi. However, the problem about 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 this approach has the same complexity as propositional revision.
展开▼
机译:在端对端激活f 1 Sub>(00)的“ k”个“最小化区域”结果参数 +1 Sup> m k Sub>中生成的方法 min Sub>→ +1 Sup> m k Sub>用于根据三元数系统的f(+ 1,0,-1)结构的算术公理进行转换模拟信号的参数“«-/ +»[m j Sub>] f(+/-)--”互补代码“转换为条件最小化位置信号的结构模拟信号±< / Sup> [m j Sub>] f усл Sub>(+/-) min Sub>及其实现的功能结构(俄罗斯逻辑版本)