U. Hustadt and R. A. Schmidt (1999b): ``On the relation of resolution and tableaux proof systems for description logics.'' In D. Thomas, editor, Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI'99) [Stockholm, Sweden, 31 July-6 August 1999], Volume 1, pp. 110-115. Morgan Kaufmann.
Abstract, BibTeX. PDF.

This paper investigates the relationship between resolution and tableaux proof system for the satisfiability of general knowledge bases in the description logic ALC. We show that resolution proof systems can polynomially simulate their tableaux counterpart. Our resolution proof system is based on a selection refinement and utilises standard redundancy elimination criteria to ensure termination. [an error occurred while processing this directive]