A resolution based description logic calculus
AbstractWe present a resolution based reasoning algorithm called DL calculus that decides concept satisfiability for the SHQ language. Unlike existing resolution based approaches, the DL calculus is defined directly on DL expressions. We argue that working on this high level of abstraction provides an easier to grasp algorithm with less intermediary transformation steps and increased efficiency. We give a proof of the completeness of our algorithm that relies solely on th e ALCHQ tableau method without requiring any further background knowledge.
Download data is not yet available.
How to Cite
Zombori, Z. (2010). A resolution based description logic calculus. Acta Cybernetica, 19(3), 571-590. Retrieved from https://cyber.bibl.u-szeged.hu/index.php/actcybern/article/view/3784