Optimised exptime tableaux for \(\mathcal{SHJN}\) over finite residuated lattices (Q1714715)

Summary: This study proposes to adopt a novel tableau reasoning algorithm for the description logic \(\mathcal{SHJN}\) with semantics based on a finite residuated De Morgan lattice. The syntax, semantics, and logical properties of this logic are given, and a sound, complete, and terminating tableaux algorithm for deciding fuzzy ABox consistency and concept satisfiability problem with respect to TBox is presented. Moreover, based on extended and/or completion-forest with a series of sound optimization technique for checking satisfiability with respect to a TBox in the logic, a new optimized ExpTime (complexity-optimal) tableau decision procedure is presented here. The experimental evaluation indicates that the optimization techniques we considered result in improved efficiency significantly.