On the Satisfiability of Quasi-Classical Description Logics
Xiaowang Zhang; School of Computer Science and Technology, Tianjin University, Tianjin & Tianjin Key Laboratory of Cognitive Computing and Application, Tianjin ; Zhiyong Feng; School of Computer Science and Technology, Tianjin University, Tianjin & Tianjin Key Laboratory of Cognitive Computing and Application, Tianjin ; Wenrui Wu; School of Computer Science and Technology, Tianjin University, Tianjin 300072 ; Mokarrom Hossain; Department of Mathematics, Statistics and Computer Science, St. Francis Xavier University, PO Box 5000, Antigonish, NS ; Wendy MacCaull; Department of Mathematics, Statistics and Computer Science, St. Francis Xavier University, PO Box 5000, Antigonish, NS
Computing and Informatics, Tome 36 (2018) no. 6, / Harvested from Computing and Informatics
Text on Computing and Informatics
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.
Publié le : 2018-02-09
Classification:  Theoretical Foundations,  Semantic web, description logics, quasi-classical logic, satisfiability, tableaux,  03-XX 
@article{cai2017_6_1415,
     author = {Xiaowang Zhang; School of Computer Science and Technology, Tianjin University, Tianjin \& Tianjin Key Laboratory of Cognitive Computing and Application, Tianjin and Zhiyong Feng; School of Computer Science and Technology, Tianjin University, Tianjin \& Tianjin Key Laboratory of Cognitive Computing and Application, Tianjin and Wenrui Wu; School of Computer Science and Technology, Tianjin University, Tianjin 300072 and Mokarrom Hossain; Department of Mathematics, Statistics and Computer Science, St. Francis Xavier University, PO Box 5000, Antigonish, NS and Wendy MacCaull; Department of Mathematics, Statistics and Computer Science, St. Francis Xavier University, PO Box 5000, Antigonish, NS},
     title = {On the Satisfiability of Quasi-Classical Description Logics},
     journal = {Computing and Informatics},
     volume = {36},
     number = {6},
     year = {2018},
     language = {en},
     url = {http://dml.mathdoc.fr/item/cai2017_6_1415}
}

Xiaowang Zhang; School of Computer Science and Technology, Tianjin University, Tianjin & Tianjin Key Laboratory of Cognitive Computing and Application, Tianjin; Zhiyong Feng; School of Computer Science and Technology, Tianjin University, Tianjin & Tianjin Key Laboratory of Cognitive Computing and Application, Tianjin; Wenrui Wu; School of Computer Science and Technology, Tianjin University, Tianjin 300072; Mokarrom Hossain; Department of Mathematics, Statistics and Computer Science, St. Francis Xavier University, PO Box 5000, Antigonish, NS; Wendy MacCaull; Department of Mathematics, Statistics and Computer Science, St. Francis Xavier University, PO Box 5000, Antigonish, NS. On the Satisfiability of Quasi-Classical Description Logics. Computing and Informatics, Tome 36 (2018) no. 6, . http://gdmltest.u-ga.fr/item/cai2017_6_1415/