The current research works and the existing problems of terminological cycles in description logics are analyzed in this paper. Referring to the works of Baader F and Nebel B, we aim in a new direction. Firstly, descr...The current research works and the existing problems of terminological cycles in description logics are analyzed in this paper. Referring to the works of Baader F and Nebel B, we aim in a new direction. Firstly, description logic vL is defined, and the description graphs GT and GJ are redefined. A syntax condition for the satisfiability of membership relation is given. By using this syntax condition, we prove the following： The subsumption reasoning in vL with respect to gfp-model, Ifp-model and descriptive model is polynomial.展开更多
基金Supported by the National Natural Science Foundation of China (Grant Nos. 60496320, 60573010 and 60663001)the National Natural Science Foundation of Guangxi Province, China (Grant No. 0447032)the Youth Science Foundation of Guangxi Province of China (Grant No. 0640030)
文摘The current research works and the existing problems of terminological cycles in description logics are analyzed in this paper. Referring to the works of Baader F and Nebel B, we aim in a new direction. Firstly, description logic vL is defined, and the description graphs GT and GJ are redefined. A syntax condition for the satisfiability of membership relation is given. By using this syntax condition, we prove the following： The subsumption reasoning in vL with respect to gfp-model, Ifp-model and descriptive model is polynomial.
