CAJ | 학술논문

为了解决限制数量约束的扩展模糊描述逻辑(EFALCQ)的推理复杂性问题,采用限制数量约束的描述逻辑(ALCQ)离散模拟EFALCQ,并重用ALCQ的推理结论来证明EFALCQ推理问题的复杂性.提出了EFALCQ一致性推理问题的ALCQ模拟方法,将EFALCQ的可满足性推理问题转换为EFALCQ的一致性推理问题,并用EFALCQ的一致性推理问题离散模拟EFALCQ的可满足区间推理问题.最后证明了EFALCQ的可满足性、一致性、以及可满足区间推理问题的推理复杂性是PSPACE-complete问题.
위료해결한제수량약속적확전모호묘술라집(EFALCQ)적추리복잡성문제,채용한제수량약속적묘술라집(ALCQ)리산모의EFALCQ,병중용ALCQ적추리결론래증명EFALCQ추리문제적복잡성.제출료EFALCQ일치성추리문제적ALCQ모의방법,장EFALCQ적가만족성추리문제전환위EFALCQ적일치성추리문제,병용EFALCQ적일치성추리문제리산모의EFALCQ적가만족구간추리문제.최후증명료EFALCQ적가만족성、일치성、이급가만족구간추리문제적추리복잡성시PSPACE-complete문제.
To solve the extended fuzzy description logic with qualifying number restriction (EFALCQ)reasoning problems, EFALCQ is discretely simulated by description logic with qualifying number restriction(ALCQ), and ALCQ reasoning results are reused to prove the complexity of EFALCQ reasoning problems. The ALCQ simulation method for the consistency of EFALCQ is proposed. This method reduces EFALCQ satisfiability into EFALCQ consistency, and uses EFALCQ satisfiability to discretely simulate EFALCQ satdomain. It is proved that the reasoning complexity for EFALCQ satisfiability, consistency and sat-domain is PSPACE-complete.