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...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.展开更多
基金The National Natural Science Foundation of China(No60403016)the Weaponry Equipment Foundation of PLA Equip-ment Ministry (No51406020105JB8103)
文摘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.
