基于描述树方法描述逻辑VL的包含推理

The Description Logic VL’s Subsumption Reasoning with Description Tree

描述逻辑是一族知识表示的语言,以形式化、结构化的方式表示相应的应用领域。描述逻辑VL非循环术语集的包含推理,通过将描述逻辑VL非循环术语集包含推理问题转化为描述树之间的同态问题,证明VL非循环术语集的包含推理问题是多项式时间复杂的。

The description logic is a family of knowledge representation languages,whose structured and formal way is to represent knowledge in a specific application.This paper studies acyclic terminologies de-scriptive logic VL’s subsumption reasoning.By transforming subsumption reasoning problem of descriptive logic VL into homomorphism between descriptive trees,it is proved that the VL subsumption acyclic terminol-ogies reasoning is polynomial time complexity.