@article{Zhang_Feng_Wu_Hossain_MacCaull_2018, title={On the Satisfiability of Quasi-Classical Description Logics}, volume={36}, url={https://www.cai.sk/ojs/index.php/cai/article/view/2017_6_1415}, abstractNote={Though quasi-classical description logic (QCDL) can tolerate the inconsistency of description logic in reasoning, a knowledge base in QCDL possibly has no model. In this paper, we investigate the satisfiability of QCDL, namely, QC-coherency and QC-consistency and develop a tableau calculus, as a formal proof, to determine whether a knowledge base in QCDL is QC-consistent. To do so, we repair the standard tableau for DL by introducing several new expansion rules and defining a new closeness condition. Finally, we prove that this calculus is sound and complete. Based on this calculus, we implement an OWL paraconsistent reasoner called QC-OWL. Preliminary experiments show that QC-OWL is highly efficient in checking QC-consistency.}, number={6}, journal={COMPUTING AND INFORMATICS}, author={Zhang, Xiaowang and Feng, Zhiyong and Wu, Wenrui and Hossain, Mokarrom and MacCaull, Wendy}, year={2018}, month={Feb.}, pages={1415–1446} }