The Temporal Description Logic TL-SI and its Decidability Algorithm

摘要：

As we known, temporal description logic can describe temporal actions in dynamic domain by temporal relations among conceptions or individuals. There are many expressive forms about temporal conceptions in fact, but these reasoning algorithms cant often convergence. This paper presents an especial temporal description logic TLSI, which contains two subswnable algorithms among temporal constraint and temporal conceptions, and the Tableau algorithms among nontemporal conceptions. This logic can express action conceptions effectively and carry out logic determination of reasoning algorithms. It offers a beneficial exploration to describe service actions for Semantic Web.

关键词： Temporal description logic Decidability algorithm Subsumption, Satisfiability

作者: Kun Hu XueLi Yu Zhi Li HongKang Zhu

作者单位: College of Computer and Software Engineering Taiyuan University of Technology Taiyuan, Shanxi, China

会议类型: 国际会议

会议名称: International Conference on Computational Aspects of Social Networks(国际社会网络计算会议 CASoN 2010)

会议地点: 太原

会议语种:英文

页码: 575-578

在线出版日期: 2010-09-26（万方平台首次上网日期，不代表论文的发表时间）