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 can´t often convergence. This paper presents an especial temporal description logic TL-SI, which contains two subsumable algorithms among temporal constraint and temporal conceptions, and the Tableau algorithms among non-temporal 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.