论文部分内容阅读
为了解决限制数量约束的扩展模糊描述逻辑(EFALCQ)的推理复杂性问题,采用限制数量约束的描述逻辑(ALCQ)离散模拟EFALCQ,并重用ALCQ的推理结论来证明EFALCQ推理问题的复杂性.提出了EFALCQ一致性推理问题的ALCQ模拟方法,将EFALCQ的可满足性推理问题转换为EFALCQ的一致性推理问题,并用EFALCQ的一致性推理问题离散模拟EFALCQ的可满足区间推理问题.最后证明了EFALCQ的可满足性、一致性、以及可满足区间推理问题的推理复杂性是PSPACE-complete问题.
In order to solve the problem of inference complexity of EFALCQ, ALCQ is used to simulate EFALCQ discretely and reuse ALCQ inference to prove the complexity of EFALCQ inference. ALCQ simulation method of EFALCQ consistency reasoning problem, EFALCQ satisfiability reasoning problem is converted into EFALCQ consistency reasoning problem, and EFALCQ consistency reasoning problem discretely simulates EFALCQ satisfiability interval inference problem.Finally, EFALCQ is proved to be Satisfaction, consistency, and inference complexity that can satisfy interval inference problems are PSPACE-complete issues.