Abstract
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.
Keywords
Cite this article
@article{cai-2371,
author = {Xiaowang Zhang and Zhiyong Feng and Wenrui Wu and Mokarrom Hossain and Wendy MacCaull},
title = {On the Satisfiability of Quasi-Classical Description Logics},
journal = {Computing and Informatics},
volume = {36},
number = {6},
pages = {1415--1446},
year = {2017},
issn = {1335-9150},
doi = {10.4149/cai_2017_6_1415}
}
TY - JOUR AU - Xiaowang Zhang AU - Zhiyong Feng AU - Wenrui Wu AU - Mokarrom Hossain AU - Wendy MacCaull TI - On the Satisfiability of Quasi-Classical Description Logics JO - Computing and Informatics VL - 36 IS - 6 SP - 1415 EP - 1446 PY - 2017 SN - 1335-9150 DO - 10.4149/cai_2017_6_1415 UR - https://doi.org/10.4149/cai_2017_6_1415 KW - Semantic web KW - description logics KW - quasi-classical logic KW - satisfiability KW - tableaux ER -
Zhang, X., Feng, Z., Wu, W., Hossain, M., & MacCaull, W. (2017). On the Satisfiability of Quasi-Classical Description Logics. Computing and Informatics, 36(6), 1415–1446. https://doi.org/10.4149/cai_2017_6_1415