We proved that the new paraconsistent tableau algorithm is decidable and has the same reasoning ability with the classical Description Logic over consistent ontologies.

证明了该算法是可判定的，而且在处理协调的本体时该推理系统与经典逻辑系统具有相等的推理能力。

youdao

We proved that the new paraconsistent tableau algorithm is decidable and has the same reasoning ability with the classical Description Logic over consistent ontologies.

证明了该算法是可判定的，而且在处理协调的本体时该推理系统与经典逻辑系统具有相等的推理能力。

youdao