Deciding the ALCNIR+-Satisfiability with a Fully Tiered Clause
In contrast with Tableau algorithm, this paper presented a totally new approach to check the satisfiabilities of acyclic ALCNIR+-concepts―FTC algorithm. This calculus can make a direct judgment on the satisfiability of an acyclic ALCNIR+-concept by translating its description into a fully tiered clause whose satisfiability is directly available. FTC algorithm eliminates description overlaps to largest extent as it works on concept description directly. Therefore, FTC algorithm has notably better performance than Tableaux by saving a lot of spatial costs.
H. M. Gu et al., "Deciding the ALCNIR+-Satisfiability with a Fully Tiered Clause", Key Engineering Materials, Vols. 439-440, pp. 1337-1342, 2010