The current extended fuzzy description logics lack reasoning algorithms with TBoxes. The problem of the satisfiability of the extended fuzzy description logic EFALC cut concepts w. r. t. TBoxes is proposed, and a reasoning algorithm is given. This algorithm is designed in the style of tableau algorithms, which is usually used in classical description logics. The transformation rules and the process of this algorithm is described and optimized with three main techniques： recursive procedure call, branch cutting and introducing sets of mesne results. The optimized algorithm is proved sound, complete and with an EXPTime complexity, and the satisfiability problem is EXPTime-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.
To solve the query processing correctness problem for semantic-based relational data integration,the semantics of SAPRQL（simple protocol and RDF query language） queries is defined.In the course of query rewriting,all relative tables are found and decomposed into minimal connectable units.Minimal connectable units are joined according to semantic queries to produce the semantically correct query plans.Algorithms for query rewriting and transforming are presented.Computational complexity of the algorithms is discussed.Under the worst case,the query decomposing algorithm can be finished in O（n2） time and the query rewriting algorithm requires O（nm） time.And the performance of the algorithms is verified by experiments,and experimental results show that when the length of query is less than 8,the query processing algorithms can provide satisfactory performance.
